Collection · 9 machines · curated by @thethinkmachine
Regular languages, start to finish
DFAs, NFAs, ε-NFAs and two-way automata — the finite-memory machines, from the textbook classics to the showcase examples.
The machines
even number of 1s
DFA · 2 states
Minimal · Deterministic
Added 28 Sept 2026Updated 28 Sept 2026
Binary divisibility by 5
DFA · 5 states
Tested · Minimal · Deterministic
Added 28 Sept 2026Updated 28 Sept 2026
guess the penultimate 1
NFA · 4 states
Added 28 Sept 2026Updated 28 Sept 2026
Keyword search: cat | car | cab
NFA · 4 states
Tested
Added 28 Sept 2026Updated 28 Sept 2026
a* then b*
ε-NFA · 3 states
Added 28 Sept 2026Updated 28 Sept 2026
Float regex, compiled
ε-NFA · 5 states
Tested
Added 28 Sept 2026Updated 28 Sept 2026
Two passes, one head
2DFA · 5 states
Tested · Deterministic
Added 28 Sept 2026Updated 28 Sept 2026
Déjà vu: the last letter is a rerun
2NFA · 8 states
Tested
Added 28 Sept 2026Updated 28 Sept 2026
Binary divisibility by 3
DFA · 3 states
Tested · Minimal · Deterministic
Added 28 Sept 2026Updated 28 Sept 2026