A framework for implementing deterministic and mutation automata with arbitrary state complexity
An implementation of standard finite state automata such as DFA, NFA, Regex
Deterministic Finite-State Automata Library for Rust, written in L1
Automafish is a state machine builder for creating deterministic state machines out of nondeterministic state machine definitions.
L* (Angluin's) Grammatical Inference Algorithm for learning Deterministic Finite Automata
SVG visualization of regex DFAs.
Library for manipulating (deterministic) finite automata
Deterministic and nondeterministic automata algorithms in Rust
A library for generating Deterministic Finite State Automata (DFA).
A crate for turning regexes into DFAs.
Parsers and interpreters for theoretical computer science topics.
A TUI to explore theoretical computer science topics.