Menu

Question Discussion & Solution

MCQ
Q.
Consider the following languages:
I. {ambncpdq ? m + p = n + q, where m, n, p, q ? 0}
II. {ambncpdq ? m = n and p = q, where m, n, p, q ? 0}
III. {ambncpdq ? m = n = p and p ? q, where m, n, p, q ? 0}
IV. {ambncpdq ? mn = p + q, where m, n, p, q ? 0}
Which of the above languages are context-free?

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 statement is correct?
forum Discussion
MCQ
2.
The language {am bn Cm+n | m, n ? 1} is
forum Discussion
MCQ
3.
Consider the languages:
L1 = {wwR |w ? {0, 1}*}
L2 = {w#wR | w ? {0, 1}*}, where # is a special symbol
L3 = {ww |  w ?  (0, 1}*)
 Which one of the following is TRUE?
forum Discussion
MCQ
4.
The context free grammar given by S ? XYX X ? aX|bX|? Y ? bbb generates the language which is defined by regular expression:
forum Discussion
MCQ
5.
Consider the grammar with productionsS ? aSb | SS | ?This grammar 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