Explore topic-wise MCQs in Automata Theory.

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

Remove all the epsilon transitions in the given diagram and compute the number of a-transitions in the result?

A. 5
B. 7
C. 9
D. 6
Answer» C. 9
Discussion
2.

Which of the steps are non useful while eliminating the e-transitions for the given diagram?a) Make a as accepting state of N’ if ECLOSE(p) contains an accepting state of Nb) Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(

A. Make a as accepting state of N’ if ECLOSE(p) contains an accepting state of N
B. Add an arc a to f1 labelled a if there is an arc labelled a in N from some state in ECLOSE(a) to f1
C. Delete all arcs labelled as e
D. None of the mentioned
Answer» E.
Discussion
3.

The number of elements present in the e-closure(f2) in the given diagram:

A. 0
B. 1
C. 2
D. 3
Answer» D. 3
Discussion
4.

Which of the following belongs to the epsilon closure set of a?

A. {f1, f2, f3}
B. {a, f1, f2, f3}
C. {f1, f2}
D. none of the mentioned
Answer» C. {f1, f2}
Discussion
5.

Design a NFA for the language:L: {an| n is even or divisible by 3}Which of the following methods can be used to simulate the same.a) e-NFAb) Power Construction Methodc) Both (

A. e-NFAb) Power Construction Methodc) Both (a) and (
B. Power Construction Method
C. Both (a) and (b)
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
6.

The number of final states we need as per the given language?Language L: {an| n is even or divisible by 3}

A. 1
B. 2
C. 3
D. 4
Answer» C. 3
Discussion
7.

Which of the following does not belong to input alphabet if S={a, b}* for any language?

A. a
B. b
C. e
D. none of the mentioned
Answer» D. none of the mentioned
Discussion