whoashish115

Projects

0 projects

A production‑grade regex engine implementing Thompson’s construction to translate regular expressions into ε‑NFA, followed by subset construction (powerset) to obtain a minimal DFA for O(n) matching. Supports concatenation, alternation, Kleene star, character classes, and anchoring. Includes rigorous property‑based testing against a Brzozowski derivative reference implementation.

Cautomataformal languagescompilers
ε‑NFA → DFA
38 sketches

Generative art, interactive visualizations, and visual experiments collected in one gallery.

View creative works