1 votes 1 votes Find a regular grammar that generates the language L (aa* (ab+ a)*). arch asked Oct 7, 2017 arch 642 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes $S \rightarrow aS | aA$ $A \rightarrow aA | aB | \epsilon$ $B \rightarrow bA | b$ Rishabh Gupta 2 answered Oct 7, 2017 • selected Oct 31, 2017 by Rishabh Gupta 2 Rishabh Gupta 2 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S→aAB A→aA|ϵ B→abB|aB|ϵ correct me if i am wrong JAINchiNMay answered Oct 8, 2020 JAINchiNMay comment Share Follow See all 0 reply Please log in or register to add a comment.