Explore topic-wise MCQs in Automata Theory.

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

Which among the following is the correct grammar for the given language?
L={x {0,1}*|number of zeroes in x number of one s in x}

A. S-> 0|SS|1SS|SS1|S1S
B. S-> 1|0S|0SS|SS0|S0S
C. S-> 0|0S|1SS|SS1|S1S
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
2.

Which of the following languages are most suitable for implement context free languages ?

A. C
B. Perl
C. Assembly Language
D. None of the mentioned
Answer» B. Perl
Discussion
3.

Which among the following is a CFG for the given Language:
L={x {0,1}*|number of zeroes in x=number of one s in x}

A. S->e|0S1|1S0|SS
B. S->0B|1A|e A->0S B->1S
C. All of the mentioned
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
4.

A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC

A. nB->a
B. Ambiguous
C. Regular
D. Non Regular
E. None of the mentioned
Answer» C. Regular
Discussion
5.

For the given Regular expression, the minimum number of terminals required to derive its grammar is:
(011+1)*(01)*

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

For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:
(011+1)*(01)*

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

What the does the given CFG defines?
S->aSbS|bSaS|e and w denotes terminal

A. wwr
B. wSw
C. Equal number of a s and b s
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
8.

State true or false:
Statement: Every right-linear grammar generates a regular language.

A. True
B. False
Answer» B. False
Discussion