If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. If Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be

(A) recursive enumerable
(B) recursive
(C) context free language (cfl)
(D) none of them

💬 Discuss

✅ Correct Answer: (A) recursive enumerable

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

286

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

81%

Success Rate