Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Manfred Droste"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 256, Iss Proc. GandALF 2017, Pp 106-120 (2017)
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:
https://doaj.org/article/64d30ef929064adfa8a1f4e1ca9a13d3
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 101-113 (2017)
Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S<
Externí odkaz:
https://doaj.org/article/ea562d73cb8c4c9897e572461fc751d1
Autor:
Manfred Droste, George Rahonis
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 149-163 (2016)
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger th
Externí odkaz:
https://doaj.org/article/834e6097303b434298bcffa3abfef95c
Autor:
Manfred Droste, Werner Kuich
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a
Externí odkaz:
https://doaj.org/article/0d2caadaa2d242c99cb046f1f0a5332a
Autor:
Manfred Droste, Guo-Qiang Zhang
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 1 (2010)
This paper studies colimits of sequences of finite Chu spaces and their ramifications. Besides generic Chu spaces, we consider extensional and biextensional variants. In the corresponding categories we first characterize the monics and then the exist
Externí odkaz:
https://doaj.org/article/3c44046672c6412d9a821cd6ddff4b50
Publikováno v:
Theoretical Computer Science. 919:118-143
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
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 101-113 (2017)
AFL
AFL
Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S<
Publikováno v:
International Journal of Foundations of Computer Science. :1-2
In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in terms of an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af2206595874c6f2e76c16406e779c1c
http://hdl.handle.net/11311/1199465
http://hdl.handle.net/11311/1199465
Autor:
Parvaneh Babari, Manfred Droste
Publikováno v:
Journal of Computer and System Sciences. 104:41-57
Picture languages have been investigated by several research groups. Here, we define weighted two-dimensional on-line tessellation automata ( w 2 ota ) taking weights from a new weight structure called picture valuation monoid. The behavior of this a