Menu

Question Discussion & Solution

MCQ
Q.
If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language, which one?

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.
A regular Grammar is a _________
forum Discussion
MCQ
2.
Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?\a. {wcwR ? w? {a,b}* } b. {wwR ? w? {a,b,c}* }c. {anbncn ? n ? 0 } d. {w ? w is a palindrome over {a,b,c} } Note: wR  is the string obtained by reversing 'w'
forum Discussion
MCQ
3.
PDA can be represented with the help of
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.
The symbol Z0 in formal definition of PDA is used for
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