DcoBA · co-Büchi ω-regular
Eventually it stops changing
The run settles: from some point on it is all a’s or all b’s. Co-Büchi acceptance marks the moments of change and accepts the words with only finitely many. The same language could be recognised by guessing which letter wins; with co-Büchi acceptance there is no need.
The author’s examples, run
(a) → accept(b) → accept(aa) → accept(bb) → accept(ab) → reject(ba) → reject(aab) → reject(aba) → reject