1 citations · 1 across the 5 of their papers we have counts for
5 papers
Free polynomial strong bimonoids
Manfred Droste, Zoltán Fülöp
Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semi…
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…
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
Manfred Droste, Zoltán Fülöp, Dávid Kószó +1
We consider weighted tree automata over strong bimonoids (for short: wta). A wta has the finite-image property if its recognized weighted tree language $[\![\mathcal{…
Composition Closure of Linear Extended Top-down Tree Transducers
Zoltán Fülöp, Andreas Maletti
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of suc…
Forward and Backward Application of Symbolic Tree Transducers
Zoltán Fülöp, Heiko Vogler
We consider symbolic tree automata (sta) and symbolic tree transducers (stt). We characterize s-recognizable tree languages (which are the tree languages recognizable by sta) in te…