GATE | GATE CS 2008 | Question 12



If L and L’ are recursively enumerable, then L is
(A) regular
(B) context-free

(C) context-sensitive
(D) recursive


Answer: (D)

Explanation: If L is recursively enumerable, then L’ is recursively enumerable if and only if L is also recursive.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.