Library

DcoBA · co-Büchi ω-regular

Eventually, every a is followed by b

FG(a → X b): a finite number of mistakes is forgiven. Co-Büchi acceptance marks the mistakes — the state reached when an a is followed by another a — and accepts the runs that visit it only finitely often.

freeoweslipabbaab
The machine as drawn — 3 states, 6 transitions.

The author’s examples, run

(b) → accept(ab) → accept(ba) → accept(bb) → accept(a) → reject(aa) → reject(aaa) → reject(aab) → reject