vu cs402 Final 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 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: Which of the following statement is true about NFA will Null string?
infinite states
infinite set of letters
infinite set of transitions
transition of null string is allowed at any stage
Question 2: a^nb^n generates the __________ langguage
regular
non regular
EQUAL and non regular
EQUAL and regular
Question 3: Set of all palindromes over {a,b} is:
Regular
Regular and finite
Regular and infinite
Non-regular
Question 7: All possible combinations of strings of a language including null string is referred as:
Concatenation of a language with itself
Kleene star closure of a language
Multiplication of a language with itself
Addition of a language with itself
Question 10: A language accepted by an FA also accepted by
TG only
GTG only
RE only
all of given
