We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them: recognized tree languages modulo the idempotency f(x, x) = x are closed under complement, besides we do not lose an important decidability result. In the paper, first we investigate the closure properties of this class for Boo...