An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Jun 9, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Basic GUI to demo the Game of Life with a variety of rule sets
A low level regular expression library that uses deterministic finite automata.
My solution, written in Rust, for the Sigma Geek and Stone Automata Maze Challenge
Represent large sets and maps compactly with finite state transducers.
Add a description, image, and links to the automaton topic page so that developers can more easily learn about it.
To associate your repository with the automaton topic, visit your repo's landing page and select "manage topics."