3 papers
cs.FL2021
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{…
cs.FL2019
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…
cs.FL2012
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…