A Language L may not be accepted by a Turing Machine if:

L can be enumerated by some turing machine

A language L is recursively enumerable if L=L(M) for some turing machine M.

Which among the following cannot be among A, B and C?

Choose the appropriate option:

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

If L is a recursive language, L’ is:

Recursive and Recursively Enumerable

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 Language L may not be accepted by a Turing Machine if:
A.	It is recursively enumerable
B.	It is recursive
C.	L can be enumerated by some turing machine
D.	None of the mentioned
Answer» C. L can be enumerated by some turing machine

Discussion

2.	A language L is recursively enumerable if L=L(M) for some turing machine M.
A.	Which among the following cannot be among A, B and C?
B.	yes w ∈ L
C.	no w ∉ L
D.	M does not halt w ∉ L
E.	None of the mentioned
Answer» E. None of the mentioned

Discussion

3.	Choose the appropriate option:
A.	Statement: If a language L is recursive, it is closed under the following operations:
B.	Union
C.	Intersection
D.	Complement
E.	All of the mentioned
Answer» E. All of the mentioned

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