What language does this deterministic finite automaton accept?
$(a^+b \mid b^+a)^*$. I am not sure there is a &quot;simple&quot; description of your language in plain English, but directly from the regex you get that it is the language that has the empty string and all strings that can be partitioned in such a way that each part is either multiple $a$'s (at least one) followed by one $b$, or vice versa.
In my opinion the regex and the automaton describe the language better than a &quot;natural language description&quot; in this case.