If L and L' are recursively enumerable, then L is
A)regular
B)context free
C)context sensitive
D)recursive

Question

Quizplus · Accepted Answer

The property of being recursively enumerable does not imply that a language is regular, context-free, or context-sensitive. However, if a language L is recursively enumerable and its complement L' is also recursively enumerable, then L is recursive. This is because a language is recursive if and only if both the language and its complement are recursively enumerable.

If L and L' Are Recursively Enumerable, Then L Is