Interactive step-by-step NFA to DFA converter with live graph visualization, powerset subset construction animation, ε-closure transition tables, and offline PWA support.

Reproducing, then improving MiniPile with PyTorch and HuggingFace

NFA to DFA converter, DFA minimization, FA acceptance in Haskell

Regular Expression to Deterministic Finite Automaton Converter.

A lex program which convert NFA to DFA and simulate DFA using its transtion table. and return matches or not

Compiler Construction project to create our own programming language.

Regex --> Postfix --> NFA --> DFA --> MinDFA

A Regular Expression engine designed to delve into the nitty-gritty of systems programming and compiler theory

Minimum spanning tree solver implemented using CPLEX in C++ and CDT for visualization.