Canonical residual automaton
= Canonical residual automaton
The canonical residual automaton of a <regular language> has its distinct <left quotients of a formal language> as states, initial state $L$, accepting states those containing the <empty word>, and letter transition $R\mapsto a^{-1}R$. It is a complete <minimal deterministic finite automaton>; every other complete <minimal deterministic finite automaton> for that language is <isomorphic> to it.