gs gs101 Regular Expressions and Languages - Operators of Regular Expression - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Regular Expressions and Languages. 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: A finite automaton accepts which type of language:
Type 0
Type 1
Type 2
Type 3
Question 2: Which among the following are incorrect regular identities?
εR=R
ε*=ε
Ф*=ε
RФ=R
Question 3: Simplify the following regular expression:
ε+1*(011) *(1*(011) *) *
ε+1*(011) *(1*(011) *) *
(1+011) *
(1*(011) *)
(1+(011) *) *
(1011) *
Question 5: Arden’s theorem is true for:
No null transitions in the transition diagrams
True for only single initial state
Non-null transitions
None of the mentioned
Question 7: In order to represent a regular expression, the first step to create the transition diagram is:
Construct the NFA using null moves.
Remove the null transitions and convert it into its equivalent DFA.
Predict the number of states to be used in order to construct the Regular expression
None of the mentioned
