aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Computer Science (GATE Exam) 2007 - Previous Question Paper Solution
  • The language {0i 21i | i $\ge$0} over the alphabet {0, 1,...
Multiple choice

The language {0i 21i | i $\ge$0} over the alphabet {0, 1, 2} is:

  1. not recursive

  2. is recursive and is a deterministic CFL.

  3. is a regular language.

  4. is not a deterministic CFL but a CFL.

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions

  • Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
  • Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
  • The language {ambm+n | m,n $\le$ 1} is
  • Consider the following languages: L1 = {WWR | W$\in$ {0, 1}*} L2 = {W # WR |W$\in$ {0, 1}*} where # is a sp...
  • Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which ...
  • Define languages L0 and L1 as follows: L0 = {M, w, 0 > 1 M halts on w} L0 = {M, w, 0 > 1 M does not halts o...
  • Define languages L0 and L1 as follows: L0 = {<M, w, 0> | M halts on w} L1 = {<M, w, 1> | M does not halt on...
  • Define languages L0 and L1 as follows: L0 = {<M, w, 0> | M halts on w} L1 = {<M, w, 1> | M does not halt on...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy