Library

NcoBA · co-Büchi ω-regular

Eventually always b, with a needless guess

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

FG b as a nondeterministic co-Büchi automaton, carrying a guess it does not need — a demonstration that NcoBA = DcoBA.

Open in AutomataStudio
More
Open in the desktop app Download the .automaton file Source on GitHub
last was…last was…guessed:…baabbb
The machine as drawn — 3 states, 6 transitions.

The author’s examples, run

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