Library

NPA · ω-regular

Exactly one of a and b, infinitely often

Infinitely many a’s and finitely many b’s, or the other way round. The machine waits, guesses which letter will win and when the other has stopped, and commits to a branch that has no edge for the loser. In its branch, the winner’s state has the even priority 0, everything else the odd 1.

waitA_aA_cB_bB_ca, b, cacacacbcbcbc
The machine as drawn — 5 states, 15 transitions.

The author’s examples, run

(a) → accept(b) → accept(aa) → accept(ac) → accept(c) → reject(ab) → reject(ba) → reject(cc) → reject