Menu

Question Discussion & Solution

MCQ
Q.
According to pumping lemma for context free languages: Let L be an infinite context free language, then there exists some positive integer m such that any w ? L with | w | ? m can be decomposed as w = u v x y z

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1. 
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 ?
forum Discussion
MCQ
2.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
forum Discussion
MCQ
3.
Consider the language L = { an ? n?0 }?{ anbn ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?
forum Discussion
MCQ
4.
The language L= {0i21i | i?0 } over the alphabet {0,1, 2} is:
forum Discussion
MCQ
5.
The entity which generate Language is termed as:
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward