Abstract: A new hyper-minimization algorithm of tree automaton was proposed in this paper. The deterministic tree automaton was transformed into deterministic finite automaton, then according to partitioned states into f-equivalence class and merged f-equivalence states algorithm of deterministic finite automaton, used hyper-minimization to the transformed automaton, got the final tree automaton which has finite differences. Compared with the exist algorithm, this algorithm is more simple and effectively, so it is an effective and easy-used algorithm.