Library/Finite automata/DFA DFA · Regular even number of 1s @thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026 The textbook Deterministic Finite Automaton example. Open in AutomataStudio More ▾ Open in the desktop app Download the .automaton file Source on GitHub q_evenq_odd0101 The machine as drawn — 2 states, 4 transitions.Every word up to length 8, one row per length in shortlex order, inked where it is accepted. DiagramLanguage