Explore topic-wise MCQs in Automata Theory.

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

State true or false:
Statement: An enumerator is a turing machine with extra output tape T, where symbols, once written, are never changed.

A. true
B. false
Answer» B. false
Discussion
2.

A recursively enumerable language L can be recursive if:

A. L is recursively enumerable
B. Every possible sequence of moves of T, the TM which accept L, causes it to halt
C. L is recursively enumerable and every possible sequence of moves of T, the TM which accept L, causes it to halt
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
3.

Choose the appropriate option:
Statement: If a language L is recursive, it is closed under the following operations:

A. Union
B. Intersection
C. Complement
D. All of the mentioned
Answer» E.
Discussion
4.

If L is a recursive language, L is:

A. Recursive
B. Recursively Enumerable
C. Recursive and Recursively Enumerable
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
5.

Choose the correct option:
Statement: If L1 and L2 are recursively enumerable languages over S, then the following is/are recursively enumerable.

A. L1 U L2
B. L2 L2
C. Both L1 U L2 and L2 L2
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
6.

The class of recursively enumerable language is known as:

A. Turing Class
B. Recursive Languages
C. Universal Languages
D. RE
Answer» E.
Discussion