I have this language that I have to prove either regular or irregular. $$ L_3 = \{mm^rn | m^r \text{ is the reverse of } m,\ m,n \in \{a,b\}^+\} $$ It's trivial to prove that it is in fact irregular using Myhill-Nerode theorem. We let $$S = \{ab,abab,ababab,\ldots\}$$, and the suffix for two strings $s_1$ and $s_2$, $\text{"ba" }\cdot (\min(|s_1|, |s_2|)\div2) + \text{"a"}$, distinguishes between them. Ex: for "ab" and "abab", suffix "baa" will work for the former but not the latter.
However, is it possible to prove that this language is irregular using just the pumping theorem? I've tried a dozen string constructions with no avail.