0 votes 0 votes Show that for every regular language not containing $λ$ there exists a right-linear grammar whose productions are restricted to the forms $A → aB$, or $A → a$, where $A, B ∈ V,$ and $a ∈ T$ Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-grammar + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 240 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.