Which of the following problems is undecidable?
(A) To determine if two finite automata are equivalent
(B) Membership problem for context free grammar
(C) Finiteness problem for finite automata
(D) Ambiguity problem for context free grammar
Ambiguity problem for context free grammar is undecidable.
So, option (D) is correct.
Quiz of this Question
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.