NFA → Min-DFA (Full Pipeline)

Full pipeline: Regex → NFA (Thompson) → DFA (Subset Construction) → Min-DFA (Minimization). Shows all intermediate steps and automata.

Supported: a-z, | (union), * (star), + (plus), ? (optional), (), [a-z] (ranges), ε