For this NFA write down the regular grammar and also accepti
For this NFA write down the regular grammar and also accepting language.
Solution
q1 -> aq2 | q3
q2 -> aaq3
q3 ->bq3 | a
q1 -> aq2 -> aaaq3 -> aaabq3 -> aaaba
L(M) = L(G)
= aaab*a + b*a
