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

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

A CFG for a program describing strings of letters with the word “main” somewhere in the string:

A. a)
Answer» B.
Discussion
2.

Which of the following is the correct representation of grammar for the given regular expression?

A. a(aUb)*b
B. a)
Answer» B. a)
Discussion
3.

Find a regular expression for a grammar which generates a language which states :

A. L contains a set of strings starting wth an a and ending with a b, with something in the middle.
B. a(a*Ub*)b
C. a*(aUb)b*
D. a(a*b*)b
E. None of the mentioned
Answer» B. a(a*Ub*)b
Discussion
4.

If P is the production, for the given statement, state true or false.

A. P: V->(V∑T)* represents that the left hand side production rule has no right or left context.
B. true
C. false
Answer» B. true
Discussion