The language (ab)(ab)^* is regular.
Proof.

Let A\mathcal{A} be the automata below. Note that q0wq1q_0 \xrightarrow{w} q_1 iff w(ab)w \in (ab)^*. Thus, we are done.