vu cs402 Mid Term - Quiz No.11
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 Mid 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: The language of all words (made up of as and bs) with at least two as can not be described by the regular expression.
a(a+b)*a(a+b)*(a+b)*ab*
(a+b)* ab* a(a+b)*
b*ab* a(a+b)*
none of these
Question 2: If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by
(r1)(r2)
(r2)*
(r1)*
(r1 + r2)
Question 4: Choose the incorrect (FALSE) statement.
A Mealy machine generates no language as such
A Mealy machine has no terminal state
For a given input string, length of the output string generated by a Moore machine is not more than the length of the output string generated by that of a Mealy machine
All of these
Question 5: S = {baa, ab}, then S* will not contain
abbaab
abab
baabaa
abbaa
Question 6: Kleenes theorem states
All representations of a regular language are equivalent.
All representations of a context free language are equivalent.
All representations of a recursive language are equivalent
Finite Automata are less powerful than Pushdown Automata.
Question 7: In FA one enter in specific stat but there is no way to leave it then state is called
Dead States
Waste Baskets
Davey John Lockers
All of above
Question 10: Pumping lemma is generally used to prove that:
A given language is infinite
A given language is not regular
Whether two given regular expressions of a=regular language are equivalent or not
None of these
