vu cs402 Mid Term - Quiz No.2
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 2: The language generated by that CFG is regular if __________
No terminal → semi word
No terminal → word
Both a and b
None of these
Question 3: S={a,bb,bab,baabb} set of strings then S* will not have
baba
baabbab
bbaaabb
bbbaabaabb
Question 4: TG is always deterministic.
TRUE
FALSE
Question 6: Using tree structure final state represent by
*
-
double circle
None of given
Question 7: If FA1 accepts no string and FA2 accepts many strings, then FA1 + FA2 will be equal
FA1
FA2
May be both
None of the given
Question 8: S → aXb|bXa
X → aX|bX|Λ
The given CFG generates the language in English __________
X → aX|bX|Λ
The given CFG generates the language in English __________
Beginning and ending in different letters
Beginning and ending in same letter
Having even-even language
None of given
Question 9: Choose the incorrect statement:
(a+b)*aa(a+b)* generates Regular language.
A language consisting of all strings over ∑={a,b} having equal number of a's and b's is a regular language
Every language that can be expressed by FA can also be expressed by RE
None of these
Question 10: Let FA3 be an FA corresponding to FA1+FA2, then the initial state of FA3 must correspond to the initial state of
FA1 only
FA2 only
FA1 or FA2
FA1 and FA2
