The language (ab)∗(ab)^*(ab)∗ is regular. Proof. Let A\mathcal{A}A be the automata below. Note that q0→wq1q_0 \xrightarrow{w} q_1q0wq1 iff w∈(ab)∗w \in (ab)^*w∈(ab)∗. Thus, we are done.