We survey some important results for weighted tree automata and weighted tree transducers
over finite ranked trees and semirings as weight structure. In particular, we address closure …

Quantitative aspects of systems can be modeled by weighted automata. Here, we deal with
such automata running on finite trees. Usually, transitions are weighted with elements of a …

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 …

A multioperator monoid A is a commutative monoid with additional operations on its carrier
set. A weighted tree automaton over A is a finite state tree automaton of which each …

We consider weighted tree automata over strong bimonoids (for short: wta). A wta A has the
finite-image property if its recognized weighted tree language [A] has finite image; moreover …

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 …

A weighted tree automaton is crisp-deterministic if it is deterministic and each of its
transitions carries either the additive or multiplicative unit of the underlying weight algebra; …

We develop a general framework for weighted parsing which is built on top of grammar-
based language models and employs flexible weight algebras. It generalizes previous work …

Weighted multioperator tree automata (for short: wmta) are finite-state bottom-up tree
automata in which the transitions are weighted with an operation taken from some …

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 …