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

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

A push down automata is said to be _________ if it has atmost one transition around all configurations.

A. Finite
B. Non regular
C. Non-deterministic
D. Deterministic
Answer» E.
Discussion
2.

A push down automata can represented using:

A. Transition graph
B. Transition table
C. ID
D. All of the mentioned
Answer» E.
Discussion
3.

Which of the following correctly resembles the given state diagram?

A. {wwr|w=(a+b)*}
B. ε is called the initial stack symbol
C. All of the mentioned
D. None of the mentioned
Answer» B. ε is called the initial stack symbol
Discussion
4.

Which of the following option resembles the given PDA?

A. {0n1n|n>=0}
B. {0n12n|n>=0}
C. {02n1n|n>=0}
D. None of the mentioned
Answer» B. {0n12n|n>=0}
Discussion