subset-construction

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

Lexers for real languages, built at runtime. C++23 combinators to a minimized DFA, with certified-safe parallel scanning.

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 Regular Expression engine designed to delve into the nitty-gritty of systems programming and compiler theory

Compiler Construction project to create our own programming language.

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

C# application that converts regular expressions into deterministic finite automata (DFA) using Thompson's construction and subset construction.

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

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