gs gs101 Push Down Automata - From PDA to Grammars - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Push Down Automata. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: The instantaneous PDA is has the following elements
State
Unconsumed input
Stack content
All of the mentioned
Question 2: The moves in the PDA is technically termed as:
Turnstile
Shifter
Router
None of the mentioned
Question 3: Which of the following option resembles the given PDA?
{0n1n|n>=0}
{0n12n|n>=0}
{02n1n|n>=0}
None of the mentioned
Question 4: Which of the following correctly resembles the given state diagram?
{wwr|w=(a+b)*}
ε is called the initial stack symbol
All of the mentioned
None of the mentioned
Question 5: Which of the following assertion is false?
If L is a language accepted by PDA1 by final state, there exist a PDA2 that accepts L by empty stack i.e. L=L(PDA1)=L(PDA2)
If L is a CFL then there exists a push down automata P accepting CF; by empty stack i.e. L=M(P)
Let L is a language accepted by PDA1 then there exist a CFG X such that L(X)=M(P)
All of the mentioned
Question 6: A push down automata can represented using:
Transition graph
Transition table
ID
All of the mentioned
Question 8: Which of the following statement is false?
For non deterministic PDA, equivalence is undecidable
For deterministic PDA, equivalence is decidable
For deterministic PDA, equivalence is undecidable
None of the mentioned
Question 9: Which of the following are the actions that operates on stack top?
Pushing
Popping
Replacing
All of the mentioned
Question 10: A push down automata is said to be _________ if it has atmost one transition around all configurations.
Finite
Non regular
Non-deterministic
Deterministic
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
