7 citations · 13 across the 11 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.FL2019★ 5 cited
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…
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.FL2019
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…