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.
Match the following:

List - IList - II
(a) Context free grammar(i)Linear bounded automaton
(b) Regular grammar(ii) Pushdown automaton
(c)Context sensitive grammar(iii) Turing machine
(d)Unrestricted grammar(iv)Deterministic finite automaton
codes:

 (a)(b)(c)(d)
(A)(ii)(iv)(iii)(i)
(B)(ii)(iv)(i)(iii)
(C)(iv)(i)(ii)(iii)
(4)(i)(iv)(iii(ii)
forum Discussion
MCQ
2.
Match the following:

forum Discussion
MCQ
3.
Given the following grammars: G1: S ? AB|aaB A ? aA | ? B ? bB | ? G2: S ? A|B A ? aAb | ab B ? abB | ? Which of the following is correct?
forum Discussion
MCQ
4.
Let L = {0n1n|n ? 0} be a context free language. Which of the following is correct ?
forum Discussion
MCQ
5.
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 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