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

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

Regular Expression denote precisely the ________ of Regular Language.

A. Class
B. Power Set
C. Super Set
D. None of the mentioned
Answer» B. Power Set
Discussion
2.

The minimum number of states required to automate the following Regular Expression:

A. (1) *(01+10) (1) *
B. 4
C. 3
D. 2
E. 5
Answer» B. 4
Discussion
3.

(0+ε) (1+ε) represents

A. {0, 1, 01, ε}
B. {0, 1, ε}
C. {0, 1, 01 ,11, 00, 10, ε}
D. {0, 1}
Answer» B. {0, 1, ε}
Discussion
4.

Arden’s theorem is true for:

A. More than one initial states
B. Null transitions
C. Non-null transitions
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
5.

P, O, R be regular expression over ∑, P is not ε, then

A. R=Q + RP has a unique solution:
B. Q*P
C. QP*
D. Q*P*
E. (P*O*) *
Answer» C. QP*
Discussion