Explore topic-wise MCQs in Automata Theory Questions and Answers.

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

1.

The e-NFA recognizable languages are not closed under :

A. Union
B. Negation
C. Kleene Closure
D. None of the mentioned
Answer» E.
Discussion
2.

For NFA with ε-moves, which among the following is correct?

A. Δ: Q X (∑ U {ε}) -> P(Q)
B. Δ: Q X (∑) -> P(Q)
C. Δ: Q X (∑*) -> P(Q)
D. All of the mentioned
Answer» B. Δ: Q X (∑) -> P(Q)
Discussion
3.

Predict the total number of final states after removing the ε-moves from the given NFA?

A. 1
B. 2
C. 3
D. 0
Answer» D. 0
Discussion
4.

ε- closure of q1 in the given transition graph:

A. {q1}
B. {q0, q2}
C. {q1, q2}
D. {q0, q1, q2}
Answer» D. {q0, q1, q2}
Discussion