Adámek J, Milius S, Moss L, Sousa L (2012)
Publication Type: Conference contribution
Publication year: 2012
Publisher: Springer-Verlag
Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series: Lecture Notes in Computer Science
City/Town: Berlin/Heidelberg
Book Volume: 7213
Pages Range: 89-103
Conference Proceedings Title: Foundations of Software Science and Computational Structures
Event location: Tallinn, Estonia
ISBN: 978-3-642-28728-2
DOI: 10.1007/978-3-642-28729-9_6
For set functors 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. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Taylor [16]. Finally, the initial iterative algebra consists of all finite well-pointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems. © 2012 Springer-Verlag Berlin Heidelberg.
APA:
Adámek, J., Milius, S., Moss, L., & Sousa, L. (2012). Well-Pointed Coalgebras (Extended Abstract). In Foundations of Software Science and Computational Structures (pp. 89-103). Tallinn, Estonia, EE: Berlin/Heidelberg: Springer-Verlag.
MLA:
Adámek, Jiří, et al. "Well-Pointed Coalgebras (Extended Abstract)." Proceedings of the 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia Berlin/Heidelberg: Springer-Verlag, 2012. 89-103.
BibTeX: Download