文章基本信息

标题：Well-Pointed Coalgebras
本地全文：下载
作者：Jiří Adámek ; Stefan Milius ; Lawrence Moss 等
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2013
卷号：9
期号：3
页码：1
DOI：10.2168/LMCS-9(3:2)2013
出版社：Technical University of Braunschweig
摘要：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.
其他关键词：Well-founded coalgebra, well-pointed coalgebra, initial algebra, final coalgebra, iterative algebra.