gs gs101 Push Down Automata - DPDA and Ambiguous 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: CFGs are more powerful than:
DFA
NDFA
Mealy Machine
All of the mentioned
Question 4: Which among the following is incorrect with reference to a derivation tree?
Every vertex has a label which is a terminal or a variable.
The root has a label which can be a terminal.
The label of the internal vertex is a variable.
None of the mentioned
Question 5: Let G=(V, T, P, S)
where a production can be written as:
S->aAS|a
A->SbA|ba|SS
Which of the following string is produced by the grammar?
where a production can be written as:
S->aAS|a
A->SbA|ba|SS
Which of the following string is produced by the grammar?
aabbaab
aabbaa
baabab
None of the mentioned
Question 6: Statement 1: Ambiguity is the property of grammar but not the language.
Statement 2: Same language can have more than one grammar.
Which of the following options are correct with respect to the given statements?
Statement 2: Same language can have more than one grammar.
Which of the following options are correct with respect to the given statements?
Statement 1 is true but statement 2 is false
Statement 1 is false but statement 2 is true
Both the statements are true
Both the statements are false
Question 7: Which of the following are non essential while simplifying a grammar?
Removal of useless symbols(non terminal) b) Removal of Unit productions and c) Removal of Null productions.
Removal of unit productions
Removal of null production
None of the mentioned
Question 8: Which of the following are context free language?
L={aibi|i>=0}
L={wwr| w is a string and r represents reverse}
All of the mentioned
one of the mentioned
Question 9: The language L ={ai2bi|i>=0} is:
recursive
deterministic CFL
regular
Two of the mentioned is correct
Question 10: L->rLt|tLr|t|r
The given grammar produces a language which is:
The given grammar produces a language which is:
All palindrome
All even palindromes
All odd palindromes
Strings with same begin and end symbols
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
