0 votes 0 votes Describe an algorithm which, when given a regular grammar $G$, can tell us whether or not $L (G) = Σ^*$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language + – Naveen Kumar 3 asked Apr 10, 2019 Naveen Kumar 3 135 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.