Explore topic-wise MCQs in Automata Theory.

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

1.

Predict the number of transitions required to automate the following language using only 3 states:
L= {w | w ends with 00}

A. 3
B. 2
C. 4
D. Cannot be said
Answer» B. 2
Discussion
2.

L1= {w | w does not contain the string tr }
L2= {w | w does contain the string tr}

A. nGiven = {t, r}, The difference of the minimum number of states required to form L1 and L2?
B. 0
C. 1
D. 2
E. Cannot be said
Answer» B. 0
Discussion
3.

John is asked to make an automaton which accepts a given string for all the occurrence of 1001 in it. How many number of transitions would John use such that, the string processing application works?

A. 9
B. 11
C. 12
D. 15
Answer» B. 11
Discussion