The theory of tree automata was established in the late sixties by Thatcher and Wright [53] and Doner [19]. They showed that the basic logical and algorithmic properties of standard automata theory can be transferred from the domain of finite words to the domain of finite trees (or terms), leading to a theory of regular tree languages. Quoting from the introduction of [53], where the theory of ...

Dubois. D. , Prade. H. 1980. Fuzzy Sets and Systems. Mathematics in Science and Engineering, Academic Press, New York, 144. Jun. Y. B. , Kavikumar. J. 2011. Bipolar Fuzzy Finite State Machines. Bull. Malays. Sci. Soc. 34 no. 1: 181-188. Kandel. A. , Lee. S. C. Fuzzy Switching and Automata Theory Applications. Edward Arnold Publishers Ltd, London. Lee. K. J. 2000. Bipolar-valued fuzzy sets and t...

This is a reissue of the book Tree Automata by F. G\'ecseg and M. Steinby originally published in 1984 by Akad\'emiai Kiad\'o, Budapest. Some mistakes have been corrected and a few obscure passages have been clarified. Moreover, some more recent contributions and current lines of research are reviewed in an appendix that also contains several new references.

The domains of partial attributed tree transducers (patt’s) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt’s having monadic output are the tree languages recognized by deterministic tree walking automata.  2000 Elsevier Science B.V. All rights reserved.