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.


Discussion

No Comment Found