0 votes 0 votes Find grammars for the following languages on Σ = {a}. (a) L = {w : |w| mod 3 = 0}. (b) L = {w : |w| mod 3 > 0}. (c) L = {w : |w| mod 3 ≠ |w| mod 2}. (d) L = {w : |w| mod 3 ≥ |w| mod 2}. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation grammar + – Naveen Kumar 3 asked Mar 19, 2019 Naveen Kumar 3 249 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.