If L and L¯ are recursively enumerable, then L is

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation

Q. If L and L¯ are recursively enumerable, then L is

(A) Regular
(B) Context free
(C) Context sensitive
(D) Recursive

💬 Discuss

✅ Correct Answer: (D) Recursive

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

167

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

94%

Success Rate