The HOM problem, which asks whether the image of a regular tree language under a given
tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The …

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 …

The HOM-problem asks whether the image of a regular tree language under a given tree
homomorphism is again regular. It was recently shown to be decidable by Godoy, Gim\'enez …

We consider finite-state automata that are equipped with a storage. Moreover, the transitions
are weighted by elements of a unital valuation monoid. A weighted automaton with storage …

We consider pairs of context-free tree grammars combined through synchronous rewriting.
The resulting formalism is at least as powerful as synchronous tree adjoining grammars and …

We introduce weighted regular tree grammars with storage as combination of (a) regular
tree grammars with storage and (b) weighted tree automata over multioperator monoids …

We introduce semiring-weighted regular tree grammars with storage where the semiring is
complete. We show that the class of weighted tree languages generated by them is a …

A query is determined by a view, if the result to the query can be reconstructed from the
result of the view. We consider the problem of deciding for two given tree transformations …

Generalizations of another two open conjectures, Conjectures 13 and 14, of [Lagoutte,
Maletti: Survey—Weighted extended top-down tree transducers—Part III: Composition. Proc …

Weighted extended top-down tree transducers (transducteurs généralisés descendants
[Arnold, Dauchet: Bi-transductions de forêts. ICALP'76. Edinburgh University Press, 1976]) …