7 citations · 13 across the 11 of their papers we have counts for
13 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…
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…
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…
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{…
Crisp-determinization of weighted tree automata over strong bimonoids
Zoltán Fülöp, Dávid Kószó, Heiko Vogler
We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; h…
Weighted Parsing for Grammar-Based Language Models over Multioperator Monoids
Richard Mörbitz, Heiko Vogler
We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs multioperator monoids as weight algebras. It generalizes prev…
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
Joost Engelfriet, Heiko Vogler
We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets o…
Weighted Regular Tree Grammars with Storage
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
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. Each we…
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…
Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics
Zoltán Fülöp, Heiko Vogler
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in…
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
Manfred Droste, Heiko Vogler
Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure…