Menu

Question Discussion & Solution

MCQ
Q.
Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?\a. {wcwR ? w? {a,b}* } b. {wwR ? w? {a,b,c}* }c. {anbncn ? n ? 0 } d. {w ? w is a palindrome over {a,b,c} } Note: wR  is the string obtained by reversing 'w'

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.
PDA can be represented with the help of
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. 
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 Discussion
MCQ
5.
If L1 is a context free language and L2 as a regular language, which of the following is/are False? a.  L1-L2 is not context free b.  L1 ? L2 is context free c.  ~L1 is context free d.  ~L2 is regular
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