Skip to content
Related Articles

Related Articles

Improve Article

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

  • Last Updated : 19 Mar, 2018

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :