gs gs101 Properties of Regular Languages - Reversal-Homomorphism and Inverse Homomorphism - 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 Properties of Regular 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: If L is a language, the reversal of the language can be represented as:
L’
Lc
Lr
more than one option is correct
Question 2: If L is a regular language, ____ is also regular.
Lr
L’
L*
All of the mentioned
Question 3: If E=F+G;
Er=?
Er=?
Fr+Gr
(F+G)r
Fr+Gr and (F+G)r
None of the mentioned
Question 4: If E= FG, Er=?
FrGr
GrFr
FrGr and GrFr
None of the mentioned
Question 5: Simplify the following identity:
E=01*+10*
ER=?
E=01*+10*
ER=?
(1*0+0*1)
(01*10*)R
(0*1+10*)
All of the mentioned
Question 6: Which of the following obey the closure properties of Regular language?
Homomorphism
Inverse Homomorphism
Reversal
All of the mentioned
Question 7: Let h(L) be a language of regular expression abe*+e(ab)*. Simplify the h(L)
(ab)*+eab*
abe*+ea*b*
(ab)*
None of the mentioned
Question 8: Let h(0)=ab; h(1)=e
Let L={abab,baba}
h-1(L)=_______
Let L={abab,baba}
h-1(L)=_______
the language of two one’s and any number of zeroes
the language of two zeroes and any number of one’s
the language of two zeroes and two one’s
none of the mentioned
Question 9: While proving Inverse Homomorphism, which of the following steps are needed?
The same set of states
The same start state
The same final state
Input alphabet = the symbols to which homomorphism h applies.
Question 10: 8. Let h(0)=ab; h(1)=e
Let L={abab,baba}
h-1(L)= the language of two zeroes and any number of one’s.
The given example belongs to which of the following?
Let L={abab,baba}
h-1(L)= the language of two zeroes and any number of one’s.
The given example belongs to which of the following?
Homomorphism
Inverse Homomorphism
Homomorphism and Inverse Homomorphism
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
