1.

If L is a recursive language, L’ is:a) Recursiveb) Recursively Ennumerablec) Both (

A. Recursiveb) Recursively Ennumerablec) Both (a) and (
B. Recursively Ennumerable
C. Both (a) and (b)
D. None of the mentioned
Answer» D. None of the mentioned


Discussion

No Comment Found

Related MCQs