Explore topic-wise MCQs in Automata Theory.

This section includes 7 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.

Which of the following are related to tree automaton?

A. Myphill Nerode Theorem
B. State machine
C. Courcelle s Theorem
D. All of the mentioned
Answer» E.
Discussion
2.

Myphill Nerode does the following:

A. Minimization of DFA
B. Tells us exactly when a language is regular
C. Minimization of DFA and tells us exactly when a language is regular
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
3.

If L is DFA-regular, L is

A. Non regular
B. DFA-regular
C. Non-finite
D. None of the mentioned
Answer» C. Non-finite
Discussion
4.

Which of the following are non regular?

A. The set of strings in {a,b}* with an even number of b s
B. The set of strings in {a, b, c}* where there is no c anywhere to the left of a
C. The set of strings in {0, 1}* that encode, in binary, an integer w that is a multiple of 3. Interpret the empty strings e as the number 0
D. None of the mentioned
Answer» E.
Discussion
5.

Which of the following language regular?

A. {a<sup>i</sup>b<sup>i</sup>|i&gt;=0}
B. {a<sup>i</sup>b<sup>i</sup>|0&lt;i&lt;5}
C. {a<sup>i</sup>b<sup>i</sup>|i&gt;=1}
D. None of the mentioned
Answer» C. {a<sup>i</sup>b<sup>i</sup>|i&gt;=1}
Discussion
6.

Which of the technique can be used to prove that a language is non regular?

A. Ardens theorem
B. Pumping Lemma
C. Ogden s Lemma
D. None of the mentioned
Answer» C. Ogden s Lemma
Discussion
7.

All the regular languages can have one or more of the following descriptions:
i) DFA ii) NFA iii) e-NFA iv) Regular Expressions

A. nWhich of the following are correct?
B. i, ii, iv
C. i, ii, iii
D. i, iv
E. i, ii, iii, iv
Answer» E. i, ii, iii, iv
Discussion