Explore topic-wise MCQs in Automata Theory.

This section includes 3 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 of the following is a regular language?

A. String whose length is a sequence of prime numbers
B. String with substring ww<sup>r</sup> in between
C. Palindrome string
D. String with even number of Zero s
Answer» E.
Discussion
2.

The production of form non-terminal -&gt; is called:

A. Sigma Production
B. Null Production
C. Epsilon Production
D. All of the mentioned
Answer» C. Epsilon Production
Discussion
3.

Given Language:Ln= {x {0,1} * | |x| n, nth symbol from the right in x is 1}

A. nHow many state are required to execute L<sub>3</sub> using NFA?
B. 16
C. 15
D. 8
E. 7
Answer» C. 15
Discussion