In this survey we generalize some results on formal tree languages, tree grammars and tree
automata by an algebraic treatment using semirings, fixed point theory, formal tree series …

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 …

In this paper we prove Kleene's result for formal tree series over a commutative semiring A
(which is not necessarily complete or continuous or idempotent), ie, the class of formal tree …

In the present paper we show that given a tree series S, which is accepted by (a) a
deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non …

We investigate the determinization of nondeterministic bottom-up/top-down finite state
weighted tree automata over some semiring A and compare the resulting four classes of …

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 …

In this book we will give a survey on several topics in language and automata theory and will
report on generalizations of some classical results on formal languages, formal tree …

In this paper we prove a Myhill-Nerode theorem for recognizable tree series over
commutative semifields and thereby present a minimization of bottom-up finite state …

Bottom-up tree series transducers (tst) over the semiring are implemented with the help of
bottom-up weighted tree automata (wta) over an extension of. Therefore bottom-up-weighted …

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 …