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.

Cellular Automata Simulator

Basic GUI to demo the Game of Life with a variety of rule sets

Solve a Wordle puzzle based on a provided word list

DFA description DSL

Simulate the BZ reaction

My solution, written in Rust, for the Sigma Geek and Stone Automata Maze Challenge

Simple representation of a cellular automaton following the rules established by Stephen Wolfram.

Manipulate regex and automaton as if they were sets.

GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action

Represent large sets and maps compactly with finite state transducers.