Theory of computation
DFA minimisation
Minimise a DFA by partition refinement: remove unreachable states, split k-equivalence groups and draw the minimal DFA, with practice.
Theory of computation
Minimise a DFA by partition refinement: remove unreachable states, split k-equivalence groups and draw the minimal DFA, with practice.