Library/Finite automata/NFA NFA · Regular guess the penultimate 1 @thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026 The textbook Nondeterministic Finite Automaton example. Open in AutomataStudio More ▾ Open in the desktop app Download the .automaton file Source on GitHub startguesspenultacc0, 110, 10, 1 The machine as drawn — 4 states, 7 transitions.Every word up to length 8, one row per length in shortlex order, inked where it is accepted. DiagramLanguage