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 …

The finiteness of ranges of tree transductions is shown to be decidable for TBY+, the
composition closure of macro tree transductions. Furthermore, TBY+ definable sets and …

We present effective criteria for first-order definability of regular tree languages. It is known
that over words the absence of modulo counting (the “noncounting property”) characterizes …

Tree automata and transducers are used in a wide range of applications in software
engineering. While these formalisms are of immense practical use, they can only model …

We introduce a new syntax-directed translation device called top-down tree-to-graph
transducer. Such transducers are very similar to the usual (total deterministic) top-down tree …

Tree automata and tree transducers are used in a wide range of applications in software
engineering, from XML processing to language type-checking. While these formalisms are of …

We introduce synchronized tree automata. They are an extension of the usual tree
automaton model where computations in independent subtrees of the input have the …

Flip-pushdown automata are pushdown automata with the additional ability to flip or reverse
its pushdown. We investigate deterministic and nondeterministic flip-pushdown automata …

A generalization of ET0L systems is introduced: grammars with branching synchronization
and nested tables. The main result is that branching synchronization grammars with tables …