| Issue |
RAIRO-Theor. Inf. Appl.
Volume 41, Number 4, October-December 2007
|
|
|---|---|---|
| Page(s) | 447 - 462 | |
| DOI | https://doi.org/10.1051/ita:2007028 | |
| Published online | 17 August 2007 | |
Recursive coalgebras of finitary functors
1
Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; adamek@iti.cs.tu-bs.de; milius@iti.cs.tu-bs.de
2
Department of Computer Science, University of Bremen, PO Box
330440, 28334 Bremen, Germany; luecke@tzi.de
Received:
14
June
2005
Accepted:
9
February
2007
For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.
Mathematics Subject Classification: 18A25 / 08C05 / 68R65
Key words: Recursive coalgebra / coalgebra / definition by recursivity
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.