If L is a recursive language, L is: – McqOptions

MCQOPTIONS

1.	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

No Comment Found

Related MCQs

State true or false:<br>Statement: An enumerator is a turing machine with extra output tape T, where symbols, once written, are never changed.
A recursively enumerable language L can be recursive if:
Choose the appropriate option:<br>Statement: If a language L is recursive, it is closed under the following operations:
If L is a recursive language, L is:
Choose the correct option:<br>Statement: If L1 and L2 are recursively enumerable languages over S, then the following is/are recursively enumerable.
The class of recursively enumerable language is known as: