说明：  简化DFA-对于一确定型自动机M=(K,Σ,Δ,s, F)，设p,q ∈K,若对于任一字符串w,由p沿w可达某终点当且仅当由q沿w可达某终点,则说p,q等价，记为p≡q。而且，≡的一个等价类恰好就是状态数最少的确定型自动机的一个状态
(Simplify the DFA-for a defined automaton M = (K, Σ, Δ, s, F), set p, q ∈ K, if for any string w, from p along w up to a certain destination if and only if along w from q up to a certain destination, then that p, q equivalent is recorded as p ≡ q. Moreover, ≡ an equivalence class is just the least number of states determine the type of a state automaton)