1 citations · 1 across the 3 of their papers we have counts for
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.FL2013★ 1 cited
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…
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…