Library

DWA · Weak ω-regular

a happens, eventually

F a, the simplest guarantee property. Two strongly connected components — waiting and done — and each lies wholly inside or wholly outside the accepting set. That is what makes an automaton weak, and why its Büchi and co-Büchi readings agree.

waitdonebaa, b
The machine as drawn — 2 states, 4 transitions.

The author’s examples, run

(a) → accepta(b) → accept(aa) → accept(ab) → accept(b) → reject(bb) → reject(bbb) → rejectbbb(b) → reject