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.

If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?

A. 1/m2
B. 2m
C. 1/m
D. log m
Answer» B. 2m
Discussion
2.

Given Language L= {xϵ {a, b}*|x contains aba as its substring}

A. Find the difference of transitions made in constructing a DFA and an equivalent NFA?
B. 2
C. 3
D. 4
E. Cannot be determined
Answer» B. 2
Discussion
3.

NFA, in its name has ’non-deterministic’ because of :

A. The result is undetermined
B. The choice of path is non-deterministic
C. The state to be transited next is non-deterministic
D. All of the mentioned
Answer» C. The state to be transited next is non-deterministic
Discussion