gs gs101 Push Down Automata - Regular Languages and D-PDA - 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: Which of the following is analogous to the following?
:NFA and NPDA
:NFA and NPDA
Regular language and Context Free language
Regular language and Context Sensitive language
Context free language and Context Sensitive language
None of the mentioned
Question 3: Which of the following relates to Chomsky hierarchy?
Regular<CFL<CSL<Unrestricted
CFL<CSL<Unrestricted<Regular
CSL<Unrestricted<CF<Regular
None of the mentioned
Question 4: A language is accepted by a push down automata if it is:
regular
context free
regular and context free
none of the mentioned
Question 5: Which of the following is an incorrect regular expression identity?
R+f=R
eR=e
Rf=f
None of the mentioned
Question 7: Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.
(a+b+ab+ba+aa+bb+aba+bab+abab+baba)*
(bbbb+aaaa)*
((a+b)(a+b)(a+b)(a+b))*
None of the mentioned
Question 8: Which of the following strings is not generated by the given grammar:
S->SaSbS|e
S->SaSbS|e
aabb
abab
abaabb
None of the mentioned
Question 9: abb*c denotes which of the following?
{abnc|n=0}
{abnc|n=1}
{anbc|n=0}
{abcn|n>0}
Question 10: The following denotion belongs to which type of language:
G=(V, T, P, S)
G=(V, T, P, S)
Regular grammar
Context free grammar
Context Sensitive 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
