vu cs402 Final Term - Quiz No.5
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: Even plindrome is a __________ language.
non-regular
regular but infinite
regular
regular but finite
Question 2: What do automata mean?
something done manually
something done automatically
Question 3: The production S --> SS | a | b | ^ can be expressed by RE
(a+b)+
(a+b)
a+b)*
(ab)*
Question 4: Chomsky normal form (CYK) algorithm was proposed by __________.
John cock
James Cock
Daniel I.A.
John Weiss
Question 6: Null production is a
Word
String
Terminal
All of the given options
Question 7: The word formal in formal language means
the symbols used have well defined meaning
they are unnessary in reality
only the form of the stringof the symbols is significant
none of these
Question 10: A read state can have __________ outgoing edge/ edges.
1
2
3
Any number of
