Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/43898
Title: | Well-Pointed Coalgebras | Authors: | Adámek, Jiří Milius, Stefan Moss, Lawrence S. Sousa, Lurdes |
Issue Date: | 9-Aug-2013 | Publisher: | Logical Methods in Computer Science e. V. | Project: | PEst-C/MAT/UI0324/2011 | Serial title, monograph or event: | Logical Methods in Computer Science | Volume: | 9 | Issue: | 3 | Abstract: | For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. The initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius and Taylor. And initial algebras are precisely the final well-founded coalgebras. Finally, the initial iterative algebra consists of all finite well-pointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems. | URI: | https://hdl.handle.net/10316/43898 | DOI: | 10.2168/LMCS-9(3:2)2013 10.2168/LMCS-9(3:2)2013 |
Rights: | openAccess |
Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
wellpointed.pdf | 308.48 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
19
checked on Apr 15, 2024
WEB OF SCIENCETM
Citations
5
15
checked on Apr 2, 2024
Page view(s) 20
709
checked on Apr 23, 2024
Download(s)
133
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.