Library

NBA · ω-regular

Classic: eventually always b

@thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026

FG b — from some point on, only b's. The textbook example of a language recognised by a nondeterministic Büchi automaton but by no deterministic one.

Open in AutomataStudio
More
Open in the desktop app Download the .automaton file Source on GitHub
anythingonly ba, bbb
The machine as drawn — 2 states, 4 transitions.

The author’s examples, run

(b) → accepta(b) → acceptab(b) → accept(ab) → reject(a) → rejectbbb(ab) → reject