Which one of the following is not decidable?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. Which one of the following is not decidable?

(A) given a Turing machine M, a string s, and an integer k, M accepts s with k steps
(B) equivalence of two given Turing machines
(C) language accepted by a given DFSA is nonempty
(D) language generated by a CFG is nonempty

💬 Discuss

✅ Correct Answer: (B) equivalence of two given Turing machines

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

819

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

98%

Success Rate