A pretreatment algorithm for minimizing deterministic finite automata based on state transition symmetry

Characters of state transition graph and corresponding treatments are not considered in current algorithms for minimizing deterministic finite automata. On this problem, a pretreatment algorithm for minimizing deterministic finite automata based on state transition symmetry is put forward. First, the concept that state transition graph symmetry is defined and the equivalence of symmetric states is proved. Second, the pretreatment algorithm is given. In the end, an experiment is carried out and the result shows that this algorithm is fairly efficient.