5 papers
The Value Generating Power of Weighted Tree Automata with Initial Algebra Semantics
Manfred Droste, Zoltán Fülöp, Andreja Tepavčević +1
We consider the generating power of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings) and the question under which condition…
Weighted Tree Automata -- May it be a little more?
Zoltán Fülöp, Heiko Vogler
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 autom…
Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
Zoltán Fülöp, Heiko Vogler
Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality…
Run supports and initial algebra supports of weighted automata
Manfred Droste, Heiko Vogler
We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for ea…
The generating power of weighted tree automata with initial algebra semantics
Manfred Droste, Zoltán Fülöp, Andreja TepavÄeviÄ +1
We consider the images of the initial algebra semantics of weighted tree automata over strong bimonoids (hence also over semirings). These images are subsets of the carrier set of…