Open In App

UGC-NET | UGC-NET CS 2017 Nov – III | Question 22

Like Article
Like
Save
Share
Report

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


Answer: (D)

Explanation: Refer:Undecidability
Ambiguity problem for context free grammar is undecidable.
So, option (D) is correct.


Quiz of this Question


Last Updated : 19 Mar, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads