The language L= {0i21i | i?0 } over the alphabet {0,1, 2} is...

MCQ

The language L= {0ⁱ21ⁱ | i?0 } over the alphabet {0,1, 2} is:

not recursive

is recursive and is a deterministic CFL

is a regular language.

is not a deterministic CFL but a CFL

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of

All palindromes

All odd length palindromes

Strings that begin and end with the same symbol

All even length palindromes

Discussion

MCQ

Let L = {0ⁿ1ⁿ|n ? 0} be a context free language. Which of the following is correct ?

L` is context free and L^k is not context free for any k ? 1.

L` is not context free and L^k is not context free for any k ? 1

Both L` and L^k is for any k ? 1 are context free.

Both L` and L^k is for any k ? 1 are not context free

Discussion

MCQ

Given the following two languages : L1 = {an bn | n ? 0, n ? 100} L2 = {w ? {a, b, c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct ?

Both L₁ and L₂ are not context free language

Both L₁ and L₂ are context free language.

L₁ is context free language, L₂ is not context free language.

L₁ is not context free language, L₂ is context free language

Discussion

MCQ

Are ambiguous grammar context free?

Yes

Discussion

MCQ

Let P be a regular language and Q be context-free language such that Q 	\subseteq P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn|n \in N}). Then which of the following is ALWAYS regular?

(A) P \cap Q

P - Q

\sum* - P

\sum* - Q

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics