In automata theory, DFA minimization is the task of transforming a given deterministic finite automaton into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Wikipedia