 Minimal deterministic finite automaton

A minimal deterministic finite automaton is the result of DFA minimization. An irreducible deterministic automaton has the fewest states among deterministic automata for its language and is unique up to isomorphism. Its states are the Myhill--Nerode classes.