Explore topic-wise MCQs in Automata Theory Questions and Answers.

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

According to Chomsky hierarchy, which of the following is adopted by Recursively Ennumerable language?

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

In one move a turing machine will:

A. Change a state
B. Write a tape symbol in the cell scanned
C. Move the tape head left or right
D. All of the mentioned
Answer» E.
Discussion