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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation and Compiler Design

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

👁️

1009

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate