Library/Finite automata/2NFA 2NFA · Regular guess and check @thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026 The textbook Two-Way Nondeterministic Finite Automaton example. Open in AutomataStudio More ▾ Open in the desktop app Download the .automaton file Source on GitHub startscanfound_aaccept⊢b, aab, a⊣ The machine as drawn — 4 states, 7 transitions.