Library

DWA · Weak ω-regular

a happens at least twice

A guarantee that counts: two a’s, at any distance. The states are how many a’s have been seen, capped at two, and the last one is a sink that accepts. Each state is its own component, so the automaton is weak, as every guarantee property’s can be.

zeroonetwobabaa, b
The machine as drawn — 3 states, 6 transitions.

The author’s examples, run

(a) → accept(aa) → accept(ab) → accept(ba) → accept(b) → reject(bb) → reject(bbb) → rejectabb(b) → reject