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.

Which of the following does not obey pumping lemma for context free languages ?

A. Finite languages
B. Context free languages
C. Unrestricted languages
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
2.

Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?

A. {aibici|i>=0}
B. {ss|s∈{a,b}*}
C. The set legal C programs
D. None of the mentioned
Answer» E.
Discussion