vu cs402 Final Term - Quiz No.16
vu cs402 Theory of Automata Quiz
This quiz belongs to book/course code vu cs402 Theory of Automata of vu organization. We have 36 quizzes available related to the book/course Theory of Automata. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. 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: If an FA accept a word then there must exist a path from
Initial to final state
Initial to each state
Initial to each state but not to final state
Initial to final state by traversing each state
Question 2: For every Context Free Grammar (CFG), we can make the corresponding __________.
FA
TG
PDA
Regular Grammar
Question 3: A PDA is called non deterministic PDA __________
there are mare then one outgoing edges at READ or POP states with one label
there are more then one PUSH states
there more than one POP states
all of the given
Question 4: A Language that is finite but not regular
Λ
(a+b)*
All strings of a's in Σ = {a,.b}
Φ
Question 5: One language can have __________ TG's
Only one
Only two
More than one
Only three
Question 6: The first rule of converting the given "CFG in CNF", is __________
CNK algorithm
CYK algorithm
CKY algorithm
KYC algorithm
Question 9: (Σ* - L) represent the __________ of a language L
Complement
Kleene's closure
Union
intersection
Question 10: The CFG which generates the regular language is called
regular expression
finite automata
regular grammar
none of given
