Sökning: id:"swepub:oai:DiVA.org:umu-80625" >
Partially ordered m...
Partially ordered monads for monadic topologies, Kleene algebras and rough sets
-
- Eklund, Patrik, 1958- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
- Galán, M.A. (författare)
- Department of Applied Mathematics, University of Málaga, Málaga, Spain
-
- Gähler, Werner (författare)
- Scheibenbergstraße 37, D-12685 Berlin, Germany
-
(creator_code:org_t)
- Elsevier, 2009
- 2009
- Engelska.
-
Ingår i: Electronic Notes in Theoretical Computer Science. - : Elsevier. - 1571-0661. ; 225, s. 67-81
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [Z. Pawlak, Rough sets, Int. J. Computer and Information Sciences 5 (1982) 341356] are modelled in a generalized setting with set functors. Further, we show how partially ordered monads can be used in order to obtain monad based examples of Kleene algebras building upon a wide range of set functors far beyond just strings [S. C. Kleene, Representation of events in nerve nets and finite automata, In: Automata Studies (Eds. C. E. Shannon, J. McCarthy), Princeton University Press, 1956, 3-41] and relations [A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941), 65-106].
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Partially ordered monads
- Monadic topologies
- Rough sets
- Kleene algebras
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas