(b) L = L (ab*a*) L ((ab)* ba).
6. Find an nfa for Exercise 17(f), Section 3.1. Use this to derive a regular
expression for that language.
7. Find the minimal dfa that accepts L(a*bb) ∪ L(ab*ba).
8. Consider the following generalized transition graph.
(a) Find an equivalent generalized transition graph with only two states.
(b) What is the language accepted by this graph?
9. What language is accepted by the following generalized transition graph?
10. Find regular expressions for the languages accepted by the following
automata.