Well-Pointed Coalgebras (Extended Abstract)

Conference contribution

Publication Details

Author(s): Adámek J, Milius S, Moss L, Sousa L
Title edited volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher: Springer-Verlag
Publishing place: Berlin/Heidelberg
Publication year: 2012
Title of series: Lecture Notes in Computer Science
Volume: 7213
Conference Proceedings Title: Foundations of Software Science and Computational Structures
Pages range: 89-103
ISBN: 978-3-642-28728-2
ISSN: 0302-9743


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.

FAU Authors / FAU Editors

Milius, Stefan apl. Prof. Dr.
Lehrstuhl für Informatik 8 (Theoretische Informatik)

External institutions with authors

Indiana University
Technische Universität Braunschweig
Universidade de Coimbra

How to cite

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.

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.


Last updated on 2018-09-08 at 23:12