An automaton is a relatively self-operating machine designed to automatically follow a sequence of operations.
The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
A low level regular expression library that uses deterministic finite automata.
GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
Represent large sets and maps compactly with finite state transducers.
Test lattice identity holding in lattice of congruences of automaton
Manipulate regex and automaton as if they were sets.
Basic GUI to demo the Game of Life with a variety of rule sets
My solution, written in Rust, for the Sigma Geek and Stone Automata Maze Challenge