vu cs402 Final Term - Quiz No.13
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 1: While determining regular expression for a given FA, it is __________ to write its regular expression.
Always possible easily
Sometime impossible
always impossible
None of the given
Question 2: A language accepted by an FA is also accepted by
TG only
GTG only
RE only
All of the given
Question 6: The product of two regular languages is __________
regular
infinite
non regular
closure of a regular language
Question 8: If the FA has N states, then test the words of length less than N. If no word is accepted by this FA, then it will __________ word/words.
accept all
accept no
accept some
reject no
