0 votes 0 votes Find a regular grammar that generates the language on $Σ =$ {$a, b$} consisting of all strings with no more than three $a$'s. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-grammar + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 164 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.