Which of the following are undecidable problems?
(a) Determining whether two grammars generate the same language
(b) Determining whether a grammar is ambiguous
(c) Both (a) and (b)
(d) None of the mentioned
This question was posed to me in class test.
The question is from The Diagonalization Languages topic in portion Undecidability of Automata Theory