Explore topic-wise MCQs in Automata Theory.

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

Consider G=({S,A,B,E}, {a,b,c},P,S), where P consists of S AB, A a, B b and E c.
Number of productions in P after removal of useless symbols:

A. 4
B. 3
C. 2
D. 5
Answer» B. 3
Discussion
2.

For each production in P of the form:
A-> x1x2x3 xn

A. nput into P that production as well as all those generated by replacing null variables with e in all possible combinations. If all x(i) are nullable,
B. A->e is put into P
C. A->e is not put into P
D. e is a member of G
E. None of the mentioned
Answer» C. A->e is not put into P
Discussion
3.

Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent grammar G having no e productions.

A. e L(G)
B. w L(G)
C. e L(G)
D. w L(G)
Answer» D. w L(G)
Discussion
4.

Simplify the given grammar:
S->aXb

A. nX->aXb | e
B. S->aXb | ab, X-> aXb | ab
C. S->X | ab, X-> aXb | ab
D. S->aXb | ab, X-> S | ab
E. None of the mentioned
Answer» B. S->aXb | ab, X-> aXb | ab
Discussion
5.

Statement:
For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.

A. nState true or false:
B. true
C. false
Answer» C. false
Discussion