Theory of Computation and Compiler Design MCQ: Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?

← All Theory of Computation and Compiler Design questions

Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?

Correct Answer: L3 n L1 is recursive

Make the most of this question

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

← More Theory of Computation and Compiler Design MCQs All Engineering topics Mock test hub