0 votes 0 votes Construct right- and left-linear grammars for the language $L =$ {$a^nb^m : n ≥ 2, m ≥ 3$}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-grammar + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 214 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.