ing from derivation trees Recall that, with every system S,em of semantic equations, we have associated a system SJp ofrecursive function procedures. Every function procedure has at least one formal… (More)

We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up tree series transducer and top-down tree series transducer, respectively, by allowing formal tree… (More)

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 based on the… (More)

A multioperator monoid $\mathcal{A}$ is a commutative monoid with additional operations on its carrier set. A weighted tree automaton over $\mathcal{A}$ is a finite state tree automaton of which each… (More)

We consider symbolic tree automata (sta) and symbolic regular tree grammars and their corresponding classes of tree languages: s-recognizable tree languages and s-regular tree languages. We prove… (More)

We present a characterization of the class of tree transformations computed by (noncircular) attributed tree transducers, in terms of a subclass of macro tree transducers, called attributed-like… (More)