QUESTION
Step 2
3. The dfa that accepts the language generated by the grammar.
ANSWERS:
6. Hence a right linear grammar for the language L((aab*ab)*) is as follows :
7. A regular grammar that generates the language on £={a,b} consisting of all strings no more than