in Theory of Computation
359 views
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^ *$.
in Theory of Computation
359 views

1 comment

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
0

2 Answers

–1 vote
–1 vote
ravindrababuravula.com
–1 vote
–1 vote
ravindrababuravula

Related questions