Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation and Compiler Design

Q. Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?

(A) L2 – L1 is recursively enumerable.
(B) L1 – L3 is recursively enumberable
(C) L2 intersection L1 is recursively enumberable
(D) L2 union L1 is recursively enumberable

💬 Discuss

✅ Correct Answer: (B) L1 – L3 is recursively enumberable

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

681

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate