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?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. 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?

(A) (L1)’ is recursive and (L2)’ is recursively enumerable
(B) (L1)’ is recursive and (L2)’ is not recursively enumerable
(C) (L1)’ and (L2)’ are recursively enumerable
(D) (L1)’ is recursively enumerable and (L2)’ is recursive

💬 Discuss

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

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

797

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate