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.

Which of the following regular expressions represents the set of strings which do not contain a substring ‘rt’ if ∑= {r, t}

A. (rt)*
B. (tr)*
C. (r*t*)
D. (t*r*)
Answer» E.
Discussion
2.

Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?

A. (0+10)*(1+ε)
B. (0+10)*(1+ε)*
C. (0+101)*(0+ε)
D. (1+010)*(1+ε)
Answer» B. (0+10)*(1+ε)*
Discussion
3.

If ∑= {0,1}, then Ф* will result to:

A. ε
B. Ф
C. ∑
D. None of the mentioned
Answer» B. Ф
Discussion
4.

Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be

A. {w | w is a string of odd length}
B. {w | w is a string of length multiple of 3}
C. {w | w is a string of length 3}
D. All of the mentioned
Answer» C. {w | w is a string of length 3}
Discussion