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.
PDA is more powerful than
forum Discussion
MCQ
2.
A DPDA is a PDA in which:
forum Discussion
MCQ
3.
With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
forum Discussion
MCQ
4.
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
5.
|-* is the __________ closure of |-
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