Finite-state machines for Rust
-
Updated
Mar 18, 2024 - Rust
Finite-state machines for Rust
Potata regex engine
Simulations of deterministic finite automata in different languages!
A low level regular expression library that uses deterministic finite automata.
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."