Which 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.

# Undecidability/TOC question,also any good notes on undecidabilty ? URGENT!

**shreya**#1