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

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

For the following change of state in FA, which of the following codes is an incorrect option?

A. δ (m, 1) = n
B. δ (0, n) = m
C. δ (m,0) = ε
D. d)
Answer» C. δ (m,0) = ε
Discussion
2.

The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is _________

A. 7
B. 6
C. 8
D. 5
Answer» B. 6
Discussion
3.

A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation

A. Union
B. Concatenation
C. Kleene*
D. All of the mentioned
Answer» E.
Discussion