{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:24Z","timestamp":1753889664574,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T00:00:00Z","timestamp":1376006400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia, I.P.","award":["PTDC\/MAT\/120222\/2010"],"award-info":[{"award-number":["PTDC\/MAT\/120222\/2010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>For endofunctors of varieties preserving intersections, a new description of\nthe final coalgebra and the initial algebra is presented: the former consists\nof all well-pointed coalgebras. These are the pointed coalgebras having no\nproper subobject and no proper quotient. The initial algebra consists of all\nwell-pointed coalgebras that are well-founded in the sense of Osius and Taylor.\nAnd initial algebras are precisely the final well-founded coalgebras. Finally,\nthe initial iterative algebra consists of all finite well-pointed coalgebras.\nNumerous examples are discussed e.g. automata, graphs, and labeled transition\nsystems.<\/jats:p>","DOI":"10.2168\/lmcs-9(3:2)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:44:29Z","timestamp":1385732669000},"source":"Crossref","is-referenced-by-count":6,"title":["Well-Pointed Coalgebras"],"prefix":"10.46298","volume":"Volume 9, Issue 3","author":[{"given":"Ji\u0159\u00ed","family":"Ad\u00e1mek","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Milius","sequence":"additional","affiliation":[]},{"given":"Lawrence S","family":"Moss","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0100-1673","authenticated-orcid":false,"given":"Lurdes","family":"Sousa","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2013,8,9]]},"reference":[{"key":"772:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/704\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/704\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:54:12Z","timestamp":1681242852000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,9]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(3:2)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1305.0576","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1305.0576","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1811.12294","asserted-by":"subject"},{"id-type":"doi","id":"10.1007\/978-3-030-17127-8_30","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1811.12294","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,8,9]]},"article-number":"704"}}