1. Baader, F., Nipkow, T.: Term Rewriting and All That ( Cambridge University Press, Cambridge 1998 ).
2. Büchi, J.R.: In D. Siefkes (Ed.) Finite Automata and Their Algebras ( Springer, New York 1989 ).
3. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra ( Springer, New York, 1981 ).
4. Comon, H. et al.: Tree Automata and Applications. http://www.grappa.univlille3.fr/tata/ .
5. Esik, Z.: Definite tree automata and their cascade compositions. Publ. Math. Debrecen, 48 (1996), 243–261.