vu cs402 Final Term - Quiz No.3
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 3: CFG given S bS|Sb|aa represents language
b*aa
aab*
b*aab*
b*(aa)*b*
Question 5: If S = { x }, then S* will be
{x,xx,xxx,xxxx,…}
{^ ,x,xx,xxx,xxxx,…}
Davey John Lockers
Dead States
Question 7: a^n b^n generates the __________ language
Regular
EQUAL and non-regular
non-regular
none of these
Question 8: FA corresponding to an NFA can be built by introducing an empty status ate for a letter having
no transition at certain state
one transition at certain state
two transition at certain state
more than two transitions at certain state
Question 9: Which of the following is a regular Context Free Grammar:
S → abS| baS | ^
S → aSb| baS | ^
S → abS| bSa | ^
S → aSb| Sa | ^
