gs gs101 Push Down Automata - DPDA and Context Free Languages - 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: Context free grammar is called Type 2 grammar because of ______________ hierarchy.
Greibach
Backus
Chomsky
None of the mentioned
Question 2: a→b
Restriction: Length of b must be atleast as much length of a.
Which of the following is correct for the given assertion?
Restriction: Length of b must be atleast as much length of a.
Which of the following is correct for the given assertion?
Greibach Normal form
Context Sensitive Language
Chomsky Normal form
Recursively Ennumerable language
Question 3: From the definition of context free grammars,
G=(V, T, P, S)
What is the solution of VÇT?
G=(V, T, P, S)
What is the solution of VÇT?
Null
Not Null
Cannot be determined, depends on the language
None of the mentioned
Question 5: There exists a Context free grammar such that:
X->aX
Which among the following is correct with respect to the given assertion?
X->aX
Which among the following is correct with respect to the given assertion?
Left Recursive Grammar
Right Recursive Grammar
Non Recursive Grammar
None of the mentioned
Question 6: If the partial derivation tree contains the root as the starting variable, the form is known as:
Chomsky hierarchy
Sentential form
Root form
None of the mentioned
Question 7: Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.
L contains a set of strings starting wth an a and ending with a b, with something in the middle.
a(a*Ub*)b
a*(aUb)b*
a(a*b*)b
None of the mentioned
Question 8: Which of the following is the correct representation of grammar for the given regular expression?
a(aUb)*b
a(aUb)*b
using special symbols to stand for substrings of a particular structure
using rules to specify how the substrings are combined to form new substrings.
(1) S → aMb (2) M → e (3) M → aMb (4) M → bMa
None of the mentioned
Question 9: A CFG consist of the following elements:
a set of terminals, which are characters of alphabets that appear in the string generated by the grammar.
a set of non terminals, which are placeholders for patterns of terminal symbols that can be generated by the nonterminal symbols.
a set of productions, which are set of rules to transit from one state to other forming up the string
a start symbol, a special non terminal symbol that appears in the initial string generated in the grammar.
