Explore topic-wise MCQs in Automata Theory.

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

For the following language, an enumerator will print:
L={anbn|n>=0}

A. a<sup>n</sup>b<sup>n</sup>
B. {ab, a<sup>2</sup>b<sup>2</sup>, a<sup>3</sup>b<sup>3</sup>, }
C. {e, ab, a<sup>2</sup>b<sup>2</sup>, a<sup>3</sup>b<sup>3</sup>, }
D. None of the mentioned
Answer» C. {e, ab, a<sup>2</sup>b<sup>2</sup>, a<sup>3</sup>b<sup>3</sup>, }
Discussion
2.

Enumerator is a turing machine with __________

A. an output printer
B. 5 input tapes
C. a stack
D. none of the mentioned
Answer» B. 5 input tapes
Discussion
3.

State true or false:
Statement: Turing Machine can change symbols on its tape, whereas the FA cannot change symbols on tape.

A. true
B. false
Answer» B. false
Discussion
4.

X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol.
Name X?

A. Push Down Automata
B. Non deterministic Finite Automata
C. Turing machines
D. None of the mentioned
Answer» D. None of the mentioned
Discussion