3 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. Theory of Computation michael-sipser theory-of-computation context-free-grammar recursive-and-recursively-enumerable-languages decidability proof + – admin 869 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
