Zobrazeno 1 - 10
of 332
pro vyhledávání: '"Droste, Manfred"'
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
Fagin's seminal result characterizing $\mathsf{NP}$ in terms of existential second-order logic started the fruitful field of descriptive complexity theory. In recent years, there has been much interest in the investigation of quantitative (weighted)
Externí odkaz:
http://arxiv.org/abs/2404.17784
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/
Autor:
Droste, Manfred, Göbel, Rüdiger
Let R be a domain, V a left R-module, and L a composition series of direct summands of V. Our main results show that if U is a stabilizer group of L containing the McLain-group associated with L, then U determines the chain (L,⊆) uniquely up to is
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A32475
https://ul.qucosa.de/api/qucosa%3A32475/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A32475/attachment/ATT-0/
Autor:
Droste, Manfred, Truss, John K.
We demonstrate the uncountable cofinality of the automorphism groups of various linear and partial orders. We also relate this to the ‘Bergman’ property, and discuss cases where this may fail even though the cofinality is uncountable.
Externí odkaz:
https://ul.qucosa.de/id/qucosa%3A32491
https://ul.qucosa.de/api/qucosa%3A32491/attachment/ATT-0/
https://ul.qucosa.de/api/qucosa%3A32491/attachment/ATT-0/
Autor:
Droste, Manfred, Kuich, Werner
Publikováno v:
In Theoretical Computer Science 29 June 2024 1002
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:
Inf. Comput. 285 B (2022) 104871
In weighted automata theory, many classical results on formal languages have been extended into a quantitative setting. Here, we investigate weighted context-free languages of infinite words, a generalization of $\omega$-context-free languages (Cohen
Externí odkaz:
http://arxiv.org/abs/2007.08866