TypeScript library for finite-state machines, with regex-to-NFA compilation, DFA minimization, execution traces and equivalence counterexamples.
Where it sits
EarliersynapseAug 2026The project
TypeScript Automata is a small library for building and comparing state machines.
It constructs and validates DFAs and epsilon-NFAs, traces input execution, compiles regular expressions to NFAs, and determinizes and minimizes machines.
The library can compare two languages and return a shortest input that distinguishes them. It also includes Mealy and Moore machines, weighted automata and Büchi acceptance checks for ultimately periodic inputs.
The implementation has no runtime dependencies and can export DFA and NFA graphs as Graphviz DOT. It is an experimental source library with a bounded regex grammar.