gs gs101 Push Down Automata - From Grammars to Push Down Automata - 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 production of the form A->B , where A and B are non terminals is called
Null production
Unit production
Greibach Normal Form
Chomsky Normal Form
Question 2: Halting states are of two types. They are:
Accept and Reject
Reject and Allow
Start and Reject
None of the mentioned
Question 4: A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d)
What does the symbol z0 represents?
What does the symbol z0 represents?
an element of G
initial stack symbol
top stack alphabet
all of the mentioned
Question 5: Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
Moves
transition function
or/not symbol
none of the mentioned
Question 6: Which among the following is true for the given statement?
Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T.
Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T.
No DPDA can accept L by empty stack
DPDA can accept L by an empty stack
L is regular
None of the mentioned
Question 7: Which of the following can be accepted by a DPDA?
The set of even length palindrome over {a,b}
The set of odd length palindrome over {a,b}
{xxc| where c stands for the complement,{0,1}}
None of the mentioned
Question 8: For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________
A
AnZ0, n>=0
Z0An, n>=0
None of the mentioned
Question 10: Let ∑={0,1}* and the grammar G be:
S->ε
S->SS
S->0S1|1S0
State which of the following is true for the given
S->ε
S->SS
S->0S1|1S0
State which of the following is true for the given
Language of all and only Balanced strings
It contains equal number of 0’s and 1’s
Ambiguous Grammar
All of the mentioned
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
