Menu

Question Discussion & Solution

MCQ
Q.
PDA is more powerful than

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.
Which of the following is a simulator for non deterministic automata?
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.
If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language, which one?
forum Discussion
MCQ
4.
Consider the NPDA ?Q = {q0, q1, q2}, ? = {0, 1}, ? = {0, 1, ?}, ?, q0, ?, F = {q2}?, where (as per usual convention) Q is the set of states, ? is the input alphabet, ? is stack alphabet, ? is the state transition function, q0 is the initial state, ? is the initial stack symbol, and F is the set of accepting states, The state transition is as following
Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton? 
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