Which of the following problems is undecidable?

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation

Q. Which of the following problems is undecidable?

(A) Membership problem for CFGs
(B) Ambiguity problem for CFGs.
(C) Finiteness problem for FSAs.
(D) Equivalence problem for FSAs.

💬 Discuss

✅ Correct Answer: (B) Ambiguity problem for CFGs.

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

885

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate