Explore topic-wise MCQs in Automata Theory.

This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.

1.

While proving Inverse Homomorphism, which of the following steps are needed?

A. Start with a DFA Ain L
B. Construct a DFA B for h-1(L)
C. The set of states, initial and final states should be same.
D. All of the mentioned
Answer» E.
Discussion
2.

Let h(0)=ab; h(1)=e
Let L={abab,baba}

A. nh-1(L)=_______
B. the language of two one s and any number of zeroes
C. the language of two zeroes and any number of one s
D. the language of two zeroes and two one s
E. none of the mentioned
Answer» C. the language of two zeroes and any number of one s
Discussion
3.

Let h(L) be a language of regular expression abe*+e(ab)*. Simplify the h(L)

A. (ab)*+eab*
B. abe*+ea*b*
C. (ab)*
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
4.

Simplify the following identity:
E=01*+10*

A. nE<sup>R</sup>=?
B. (1*0+0*1)
C. (01*10*)<sup>R</sup>
D. (0*1+10*)
E. All of the mentioned
Answer» B. (1*0+0*1)
Discussion
5.

If E=F+G;
Er=?

A. F<sup>r</sup>+G<sup>r</sup>
B. (F+G)<sup>r</sup>
C. F<sup>r</sup>+G<sup>r</sup> and (F+G)<sup>r</sup>
D. None of the mentioned
Answer» B. (F+G)<sup>r</sup>
Discussion