Menu

Question Discussion & Solution

MCQ
Q.
In the correct grammar of above question, what is the length of the derivation (number of steps starring from S) to generate the string albm with l ? m? 

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.
Context free grammar is not closed under:
forum Discussion
MCQ
2.
 Consider the language L1,L2,L3 as given below. L1={0^{p}1^{q} | p,q \in N} L2={0^{p}1^{q} | p,q \in N and p=q} L3={0^{p}1^{q}0^{r} | p,q,r \in N and p=q=r} Which of the following statements is NOT TRUE?
forum Discussion
MCQ
3.
If all the production rules have single non - terminal symbol on the left side, the grammar defined is:
forum Discussion
MCQ
4.

Which of these languages are not context free

forum Discussion
MCQ
5.
The language L= {0i21i | i?0 } over the alphabet {0,1, 2} is:
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs