Menu

Question Discussion & Solution

MCQ
Q. 
Consider the following two Grammars : G1 : S ? SbS|a G2 : S ? aB|ab, A?GAB|a, B?ABb|b Which of the following option is correct ?

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 push down automata is different than finite automata by
forum Discussion
MCQ
2.
Let LD  be the set of all languages accepted by a PDA by final state and LF  the set of all languages accepted by empty stack. Which of the following is true?

forum Discussion
MCQ
3.
The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as
forum Discussion
MCQ
4.
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
5.
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

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