Explore topic-wise MCQs in Automata Theory.

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

Inorder to simplify a context free grammar, we can skip the following operation:

A. Removal of null production
B. Removal of useless symbols
C. Removal of unit productions
D. None of the mentioned
Answer» E.
Discussion
2.

Given:
S-> ->xAy-> ->w

A. nif ____________, then A is useful, else useless symbol.
B. A is a non terminal
C. A is a terminal
D. w L
E. w L
Answer» D. w L
Discussion
3.

Given Grammar: S->A, A->aA, A->e, B->bA
Which among the following productions are Useless productions?

A. S->A
B. A->aA
C. A->e
D. B->bA
Answer» E.
Discussion
4.

Suppose A->xBz and B->y, then the simplified grammar would be:

A. A->xyz
B. A->xBz|xyz
C. A->xBz|B|y
D. none of the mentioned
Answer» B. A->xBz|xyz
Discussion