Extra Education
← All Theory of Computation questions
1

Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?

Correct Answer: (L1)’ is recursive and (L2)’ is not recursively enumerable

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQsAll Engineering topicsMock test hub
Theory of Computation MCQ: Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE? | Extra Education