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 = {anban|n > 0} L2 = {an b an bn + 1|n > 0} Which of the following is correct ?
forum Discussion
MCQ
2.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
3.
Which of the following statement is correct?
forum Discussion
MCQ
4.
Context sensitive language can be recognized by a :
forum Discussion
MCQ
5. 
Given a Turing Machine M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, ?, B, {q3}) Where ? is a transition function defined as ?(q0, a) = (q1, a, R) ?(q1, b) = (q2, b, R) ?(q2, a) = (q2, a, R) ?(q3, b) = (q3, b, R) The language L(M) accepted by the Turing Machine is given 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