Finite Automata
CS 432 — Thompson’s construction · Subset construction · Hopcroft’s algorithm
Generated with the assistance of Claude Code (Opus 5)
Legend:
→ qstart state
accepting state
new this step (NFA/DFA)
ε transition
equiv. classes (Min-DFA)
NFA — Thompson’s Construction
RE → NFA using ε-transitions (bottom-up inductive build)
Enter a regex above and click Visualize
DFA — Subset Construction
NFA → DFA (each DFA state = subset of NFA states)
Enter a regex above and click Visualize
Min-DFA — Hopcroft’s Algorithm
DFA → minimal DFA (partition refinement; same-color states merge)
Enter a regex above and click Visualize