Menu

Question Discussion & Solution

MCQ
Q.
The pushdown automation M = ({q0, q1, q2 }, {a, b}, {0, 1}, ?, q0 , 0, {q0}) with ? (q0, a, 0) = {q1 , 10} ? (q1, a, 1) = {q1 , 11} ? (q1, b, 1) = {q2 , ?} ? (q2, b, 1) = {q2 , ?} ? (q2, ?, 0) = {q0 , ?} Accepts the language

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.
Consider the following languages. 
gatecs2013.12
Which one of the following statements is FALSE?
forum Discussion
MCQ
2.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
forum Discussion
MCQ
3.
Match the following:

forum Discussion
MCQ
4.
Given the following grammars: G1: S ? AB|aaB A ? aA | ? B ? bB | ? G2: S ? A|B A ? aAb | ab B ? abB | ? Which of the following is correct?
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