Menu

Question Discussion & Solution

MCQ
Q.
The context free grammar S ? SS | 0S1 | 1S0 | ? generates _________

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.
Which of the following language(s) generates more than one parse tree for a string ?

L1 = {a^nb^mc^md^n ? {a, b, c, d}* | n, m ? 0} 
      ? {a^nb^nc^md^m ? {a, b, c, d}* | n, m ? 0} 

L2 = {a^nb^mc^m ? {a, b, c}* | n, m ? 0} 
      ? {a^nb^nc^m ? {a, b, c}* | n, m ? 0}

L3 = {a^nb^mc^p ? {a, b, c}* | n ? m; n, m ? 0} 
      ? {a^nb^mc^p ? {a, b, c}* | m ? p; n, m ? 0}
forum Discussion
MCQ
2.
Assume Statement S1 and S2 defined as:S1:L2-L1 is recursive enumerable Where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turnig machine is countable. Which of the following is true?
forum Discussion
MCQ
3.
Which of the following will not be accepted by the following DFA?

forum Discussion
MCQ
4.
The language L={0?1?0?| m ? 1} is a
forum Discussion
MCQ
5.
Which of the following conversion is not possible (algorithmically)?
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