Explore topic-wise MCQs in Automata Theory Questions and Answers.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers 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.

A. Number of productions in P’ after removal of useless symbols:
B. 4
C. 3
D. 2
E. 5
Answer» B. 4
Discussion
2.

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