The theory of tree automata and tree languages emerged in the middle of the 1960s quite
naturally from the view of finite automata as unary algebras advocated by JR Biichi and JB …

The subject of this book is the investigation of tree transducers. Tree trans ducers were
introduced in theoretical computer science in order to study the general properties of formal …

A characterization is given of the class of tree translations definable in monadic second-
order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO …

Two well-known formalisms for the specification and computation of tree transductions are
compared: the mso graph transducer and the attributed tree transducer with look-ahead …

This is a book on weighted tree automata. We present the basic definitions and some of the
important results in a coherent form with full proofs. The concept of weighted tree automata …

We consider tree series transducers which were introduced in [EFV], and define the tree-to-
tree series transformations computed by them in two different ways. One of the definitions is …

We study the problem to transform functional programs, which intensively use append
functions (like inefficient list reversal), into programs, which use accumulating parameters …

In this paper we introduce a new formal model for the concept of syntaxdirected semantics,
called macro attributed tree transducer (for short: mat tree transducer). This model is based …

Attributed tree transducers are abstract models used to study properties of attribute
grammars. One abstraction which occurs when modeling attribute grammars by attributed …

During the execution of functional logic programs, E-unification problems have to be solved
quite frequently, where the underlying equational theory is induced by recursive functions …