Explore topic-wise MCQs in Automata Theory.

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

Given grammar G:S->aS| ABA-> eB-> eD-> bReduce the grammar, removing all the e productions:

A. S->aS| AB| A| B, D-> b
B. S->aS| AB| A| B| a, D-> b
C. S->aS| AB| A| B
D. None of the mentioned
Answer» C. S->aS| AB| A| B
Discussion
2.

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
3.

For the given grammar G:S->ABaCA->BCB->b| eC->D| eD-> dRemove the e productions and generate the number of productions from S in the modified or simplified grammar.

A. 6
B. 7
C. 5
D. 8
Answer» E.
Discussion
4.

For each production in P of the form:A-> x1x2x3…xnput 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,

A. A->e is put into P’
B. A->e is not put into P’
C. e is a member of G’
D. None of the mentioned
Answer» C. e is a member of G’
Discussion
5.

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
6.

Consider the following grammar:A->eB->aAbCB->bAbAA->bBThe number of productions added on the removal of the nullable in the given grammar:

A. 3
B. 4
C. 2
D. 0
Answer» C. 2
Discussion
7.

Simplify the given grammar:S->aXbX->aXb | e

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

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.State true or false:

A. true
B. false
Answer» C.
Discussion
9.

CONSIDER_G=({S,A,B,E},_{A,B,C},P,S),_WHERE_P_CONSISTS_OF_S_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚Àւ†AB,_A_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚Àւ†A,_B_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚Àւ†B_AND_E_‚ÄÖ√Ñ√∂‚ÀÖ√∫‚Àւ†C.?$#

A.
B. 4
C. 3
Answer» B. 4
Discussion
10.

For each production in P of the form:

A.
B. are nullable,
C. A->e is put into P’
Answer» C. A->e is put into P‚Äö√Ñ√∂‚àö√ë‚àö¬•
Discussion
11.

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
12.

Simplify the given grammar:

A.
B.
Answer» B.
Discussion
13.

Statement:

A.
B.
Answer» C.
Discussion
14.

The variable which produces an epsilon is called:

A. empty variable
B. nullable
C. terminal
D. all of the mentioned
Answer» C. terminal
Discussion
15.

The use of variable dependency graph is in:

A. Removal of useless variables
B. Removal of null productions
C. Removal of unit productions
D. None of the mentioned
Answer» B. Removal of null productions
Discussion