Now applying either regular grammars or regular expressions, prove that regular languages are closed under the star closure operation. Include an explanation and example why one method (regular expressions vs. regular grammars) was chosen over the other.

Answer rating: 100% (QA)

To prove that regular languages are closed under the star closure operation we can use either regula... View the full answer