Skip to content
Related Articles

Related Articles

GATE | GATE CS 2008 | Question 12
  • Last Updated : 28 Jan, 2014

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
Recommended Articles
Page :