Zobrazeno 1 - 10
of 198
pro vyhledávání: '"Vogler, Heiko"'
Autor:
Droste, Manfred, Vogler, Heiko
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 each such weighted automaton, its run semantics and its initial algebra
Externí odkaz:
http://arxiv.org/abs/2409.08727
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 the underlying strong bimonoid. We consider locally finite, weakly loc
Externí odkaz:
http://arxiv.org/abs/2405.20753
Autor:
Fülöp, Zoltán, Vogler, Heiko
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 automata is part of Automata Theory and it touches the area of Universal Al
Externí odkaz:
http://arxiv.org/abs/2212.05529
We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need to hold. We define two different behaviors and prove precise characterizat
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A32477
https://ul.qucosa.de/api/qucosa%3A32477/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A32477/attachment/ATT-0/
Publikováno v:
In Information and Computation December 2024 301 Part B
We consider weighted tree automata over strong bimonoids (for short: wta). A wta $\mathcal{A}$ has the finite-image property if its recognized weighted tree language $[\![\mathcal{A}]\!]$ has finite image; moreover, $\mathcal{A}$ has the preimage pro
Externí odkaz:
http://arxiv.org/abs/2106.15867
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, Automata, Logic and Semantics (June 15, 2021) dmtcs:5943
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; however, for bottom-up deterministic wta and for wta over semirings, th
Externí odkaz:
http://arxiv.org/abs/1912.02660
Publikováno v:
In Theoretical Computer Science 10 November 2023 979
Autor:
Mörbitz, Richard, Vogler, Heiko
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 previous work in that area (semiring parsing, weighted deductive parsing)
Externí odkaz:
http://arxiv.org/abs/1911.06585
Autor:
Engelfriet, Joost, Vogler, Heiko
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 22 no. 4, Automata, Logic and Semantics (August 27, 2020) dmtcs:5424
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 of graphs as storage configurations and as storage transformations. We
Externí odkaz:
http://arxiv.org/abs/1905.00559