Library/Finite automata/ε-NFA ε-NFA · Regular a* then b* @thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026 The textbook Finite Automaton with ε-Transitions example. Open in AutomataStudio More ▾ Open in the desktop app Download the .automaton file Source on GitHub starta_starb_starεεab The machine as drawn — 3 states, 4 transitions.Every word up to length 8, one row per length in shortlex order, inked where it is accepted. DiagramLanguage