Zobrazeno 1 - 10
of 439
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
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
Autor:
Droste, Manfred, Gastin, Paul
By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata form a ge
Externí odkaz:
http://arxiv.org/abs/1902.08149
Publikováno v:
In Information and Computation May 2022 285 Part B
Publikováno v:
EPTCS 256, 2017, pp. 106-120
We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime networ
Externí odkaz:
http://arxiv.org/abs/1709.02098