2 votes 2 votes Which of the following problems is undecidable? To determine if two finite automata are equivalent Membership problem for context free grammar Finiteness problem for finite automata Ambiguity problem for context free grammar Theory of Computation ugcnetcse-nov2017-paper3 theory-of-computation decidability + – Arjun asked Nov 5, 2017 • edited Jul 4, 2020 by go_editor Arjun 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Ambiguity problem for context free grammar is undecidable. So, option (D) is correct. Refer:Undecidability Prasanjeet Ghosh answered Jun 11, 2018 Prasanjeet Ghosh comment Share Follow See all 0 reply Please log in or register to add a comment.