I constructed the automaton below using the assumption that the language described by the regular expression above only accepted the following strings:
Empty, aabab, babab, aaaabab, bbbabab etc
Initially, I assumed that abab would not be accepted. (Not sure about this) Can someone please confirm if I have it right or if the automaton is missing something?
Fixed automaton: (Is this one correct?)