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.

Which among the following is false?
-closure of a subset S of Q is:

A. Every element of S Q
B. For any q (S), every element of (q, ) is in (S)
C. No other element is in (S)
D. None of the mentioned
Answer» E.
Discussion
2.

For NFA with -moves, which among the following is correct?

A. : Q X ( U { }) -> P(Q)
B. : Q X ( ) -> P(Q)
C. : Q X ( *) -> P(Q)
D. All of the mentioned
Answer» B. : Q X ( ) -> P(Q)
Discussion
3.

Predict the total number of final states after removing the -moves from the given NFA?

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

- closure of q1 in the given transition graph:

A. {q1}
B. {q0, q2}
C. {q1, q2}
D. {q0, q1, q2}
Answer» D. {q0, q1, q2}
Discussion
5.

Statement 1: - transition can be called as hidden non-determinism.
Statement 2: (q, ) = p means from q it can jump to p with a shift in read head.

A. nWhich among the following options is correct?
B. Statement 1 and 2, both are correct
C. Statement 1 and 2, both are wrong
D. Statement 1 is correct while Statement 2 is wrong
E. Statement 1 is wrong while Statement 2 is correct
Answer» D. Statement 1 is correct while Statement 2 is wrong
Discussion
6.

State true or false?
Statement: (Input) does not appears on Input tape.

A. True
B. False
Answer» B. False
Discussion
7.

State true or false?
Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.

A. True
B. False
Answer» B. False
Discussion