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.

L->rLt|tLr|t|r

A. The given grammar produces a language which is:
B. All palindrome
C. All even palindromes
D. All odd palindromes
E. Strings with same begin and end symbols
Answer» D. All odd palindromes
Discussion
2.

The language L ={ai2bi|i>=0} is:

A. recursive
B. deterministic CFL
C. regular
D. Two of the mentioned is correct
Answer» E.
Discussion