I'm learning the formal language and the theory of computation, and new in draw finite automata. So I want to ask how to draw FA or NFA for:
b*(ab) * a*
The simplified automaton is this one:
Where 1 is the starting state and all states are accepting states. It needs to be completed with a "Trash" state where all missing transitions will go.