Which one of the following problems is undecidable?

A Deciding if a given context-free grammar is ambiguous
B Deciding if a given string is generated by a given context-free grammar
C Deciding if the language generated by a given context-free grammar is empty
D Deciding if the language generated by a given context-free grammar is finite

Answer & Explanation

Answer: Option [A]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source