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)^*$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 5, 2019 Naveen Kumar 3 269 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.