3 votes

Say that a $CFG$ is minimal if none of its rules can be removed without changing the language generated. Let $MIN_{CFG} = \{\langle G \rangle \mid \text{G is a minimal CFG}\}$.

- Show that $MIN_{CFG}$ is $T-$recognizable.
- Show that $MIN_{CFG}$ is undecidable.