vu cs402 Mid Term - Quiz No.14
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: Every regular expression can be expressed as CFG but every CFG cannot be expressed as a regular expression. This statement is:
TRUE
FALSE
Depends on the language
None of the given options
Question 2: One FA has n states and m letters in the alphabet. Then FA will have __________ number of transitions in the diagram.
(m)(n) OR (n)(m) rep
None of the given options
(n)+(m)
(m)-(n)
Question 3: Auto Meta mean
Manual work
Automatic work
1
2
Question 4: Formal is also known as __________
Semantic language
Syntactic language
Informal language
None of these
Question 6: Let S = {aa, bb} be a set of strings then s* will have
Λ
abba
aabbbaa
bbaab
Question 7: For language L defined over {a, b}, then L partitions {a, b}* into __________ classes
Infinite
Finite
Distinct
Non-distinct
Question 8: RE for the language defined over Σ={a,b} having words starting with a is __________
a(a+b)*
(a+b)*a
(a+b)*
None of these
Question 10: If in an NFA, ^ is allowed to be a label of an edge then that NFA is called __________.
NFA with null string
Either "NFA with null string" OR "NFA with "
Will not remain NFA
NFA with
