in Theory of Computation
263 views
0 votes
0 votes
Let $G_1$ and $G_2$ be two regular grammars. Show how one can derive regular grammars for the languages
(a) $L (G_1) ∪ L (G_2)$.
(b) $L (G_1) L (G_2)$.
(b) $L (G_1)^*$.
in Theory of Computation
263 views

Please log in or register to answer this question.

Related questions