Formal Language and Automata Theory

- 12 Show that L = {a"n24) is regular. Design an nfa with no more than five states for the set {abab" : n >0}U {aba": n >0}