Library

DWA · Weak ω-regular

An a, and no b ever after it

F a ∧ G(a → G ¬b): an obligation, part guarantee and part safety. Waiting is rejecting, the state after the first a is accepting, and a b after that has no edge. Three components, none straddling the accepting set.

waitafterb, caa, c
The machine as drawn — 2 states, 5 transitions.

The author’s examples, run

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