Explore topic-wise MCQs in Automata Theory.

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

A___________ is context free grammar with atmost one non terminal in the right handside of the production.

A. linear grammar
B. linear bounded grammar
C. regular grammar
D. none of the mentioned
Answer» B. linear bounded grammar
Discussion
2.

If L1 and L2 are context free languages, L1-L2 are context free:

A. always
B. sometimes
C. never
D. none of the mentioned
Answer» D. none of the mentioned
Discussion
3.

Which of the following is incorrect?There exists algorithms to decide if:

A. String w is in CFL L
B. CFL L is empty
C. CFL L is infinite
D. All of the mentioned
Answer» E.
Discussion