vu cs402 Mid Term - Quiz No.1
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: FA1 corresponds to r*, then FA1 must accept __________ string.
Every
Null
Odd length
Even length
Question 2: If S = {aa, bb}, then S* will not contain..
aaabbb
aabbaa
bbaabbbb
aabbbb
Question 4: If a CFG has a null production, then it is __________
Posiible to construct another CFG without null production accepting the same language with the exception of the word ^
Not possible to construct another CFG without null production accepting the same language with the exception of the word ^
Called NULL CFG
Called Chmosky Normal Form (CNF)
Question 5: Choose the correct statement.
A Mealy machine generates no language as such
A Moore machine generates no language as such
A Mealy machine has no terminal state
All of these
Question 6: The major problem in the earliest computers was
To store the contents in the registers
To display mathematical formulae
To load the contents from the registers
To calculate the mathematical formula
Question 7: If L1 and L2 are regular languages __________ is/are also regular language(s).
L1 + L2
L1L2
L1*
All of above
Question 8: The symbols that must be replaced by other things are called __________
Productions
Terminals
Non-terminals
None of given
Question 9: The following problem(s) __________ is/are called decidable problem(s).
The two regular expressions define the same language
The two FAs are equivalent
Both a and b
None of given
Question 10: FA1 and FA2 are two FA's representing two languages. Then FA3, which is sum of FA1 and FA2, will accept the strings which are
Accepted by FA1 OR FA2
None of the given options
Accepted by FA1 AND FA2
Accepted by FA1 AND/OR FA2
