2 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
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…