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.
Which of the following statements is true?
forum Discussion
MCQ
2.
PDA can be represented with the help of
forum Discussion
MCQ
3.
Define for a context free language L ? {0, 1}* ,  init(L)={u ? uv ? L for some v in {0,1}?} ( in other words, init(L) is the set of prefixes of L) Let L = {w ? w is nonempty and has an equal number of 0
forum Discussion
MCQ
4.
Consider the following languages.

L1 = {ai bj ck | i = j, k ? 1}
L1 = {ai bj | j = 2i, i ? 0}
Which of the following is true?
forum Discussion
MCQ
5.
A PDA machine configuration (p, w, y) can be correctly represented as:
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