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.
If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations

forum Discussion
MCQ
2.
Push down automata accepts which language?
forum Discussion
MCQ
3.
In a pushdown automaton P=(Q,?,?,?,q0,F), a transition of the form,
where p,q?Q, a???{?}, X,Y,???{?}, represents
(q,Y) ? ?(p,a,X)
Consider the following pushdown automaton over the input alphabet ?={a,b} and stack alphabet ?={#,A}.
The number of strings of length 100 accepted by the above pushdown automaton is ___________ . 
forum Discussion
MCQ
4.
A language accepted by Deterministic Push down automata is closed under which of the following?
forum Discussion
MCQ
5.
A regular Grammar is a _________
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