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.

The minimum number of transitions to pass to reach the final state as per the following regular expression is:

A. {a,b}*{baaa}
B. 4
C. 5
D. 6
E. 3
Answer» B. 4
Discussion
2.

Generate a regular expression for the given language:l

A. L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
B. (0+01)*
C. (0+01)*1
D. (0+01)*(1+01)
E. All of the mentioned
Answer» D. (0+01)*(1+01)
Discussion
3.

The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3

A. 3
B. 4
C. 5
D. 1
Answer» D. 1
Discussion
4.

Which of the given regular expressions correspond to the automata shown?

A. (110+1)*0
B. (11+110)*1
C. (110+11)*0
D. (1+110)*1
Answer» D. (1+110)*1
Discussion
5.

Which of the following is same as the given DFA?

A. (0+1)*001(0+1)*
B. 1*001(0+1)*
C. (01)*(0+0+1)(01)*
D. None of the mentioned
Answer» B. 1*001(0+1)*
Discussion