Menu

Question Discussion & Solution

MCQ
Q.
State true or false:Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

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.
|-* is the __________ closure of |-
forum Discussion
MCQ
2.
PDA is more powerful than
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.
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 Discussion
MCQ
5.
Regarding the power of recognition of languages, which of the following statement is false?
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