Menu

Question Discussion & Solution

MCQ
Q.
Which of the following languages are context-free?

L1 = {ambnanbm ? m, n ? 1}
L2 = {ambnambn ? m, n ? 1}
L3 = {ambn ? m = 2n + 1}

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.
Pushdown automata can recognize language generated by_________.
forum Discussion
MCQ
2.
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:
forum Discussion
MCQ
3.
A regular Grammar is a _________
forum Discussion
MCQ
4.
Which of the following languages are context-free?

L1 = {ambnanbm ? m, n ? 1}
L2 = {ambnambn ? m, n ? 1}
L3 = {ambn ? m = 2n + 1}
forum Discussion
MCQ
5.
Which of the following statements is true?
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