Explore topic-wise MCQs in Automata Theory.

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

Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in ___________

A. restricted form
B. parsed form
C. normal form
D. all of the mentioned
Answer» D. all of the mentioned
2.

The format: A->aB refers to which of the following?

A. Chomsky Normal Form
B. Greibach Normal Form
C. Backus Naur Form
D. None of the mentioned
Answer» C. Backus Naur Form