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.

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

Reproducing, then improving MiniPile with PyTorch and HuggingFace

Regular Expression to Deterministic Finite Automaton Converter.

Compiler Construction project to create our own programming language.

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

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

Simulator DFA & NFA-ε: simulasi string, konversi NFA → DFA (subset construction), minimisasi, verifikasi, dan diagram Graphviz — Teori Bahasa dan Automata

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

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

Theory of Computation engine: Thompson's Construction (Regex to NFA), Subset Construction (NFA to DFA), string simulation, and Mermaid diagram export

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