0 votes 0 votes Find a regular grammar that generates the language $L=$ {$w∈$ {$a,b$}$^*:n_a(w)+3n_b(w)$ is even } . Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-grammar + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 165 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.