0 votes 0 votes Show that any regular grammar $G$ for which $L (G) ≠ Ø$ must have at least one production of the form $A → x$ where $A ∈ V$ and $x ∈ T^ *$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-grammar + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 361 views answer comment Share Follow See 1 comment See all 1 1 comment reply !KARAN commented Apr 3, 2019 reply Follow Share Since it is already given that grammar is regular grammar and $LG) \not = \phi$. So this means that for a grammar to be regular it can be either left linear or right linear. So in any of the case for left or right linear it must have a production which must terminate and give a valid string. So the grammar can be for example $S \rightarrow aS\\S \rightarrow a \\ or \\ S \rightarrow aS\\S \rightarrow \epsilon $ 0 votes 0 votes Please log in or register to add a comment.
–1 votes –1 votes ravindrababuravula.com askeshavas answered Apr 3, 2019 askeshavas comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes ravindrababuravula askeshavas answered Apr 3, 2019 askeshavas comment Share Follow See all 0 reply Please log in or register to add a comment.