Minimize a DFA using the table-filling algorithm. Identifies equivalent states and merges them.
Use the NFA → DFA tool and click Copy for Minimization to paste here, or enter a DFA manually.
One line per transition: from symbol to.
Declare start: q and accept: q[, q…] at the top.