55 views

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}\}$.

1. Show that $MIN_{CFG}$ is $T-$recognizable.
2. Show that $MIN_{CFG}$ is undecidable.
| 55 views