Theoret. Informatics Appl. 41, 447-462 (2007)
DOI: 10.1051/ita:2007028

Recursive coalgebras of finitary functors

Jirí Adámek¹, Dominik Lücke² and Stefan Milius<sup>1

1</sup>  Technical University of Braunschweig, Institute of Theoretical Computer Science, Braunschweig, Germany; adamek@iti.cs.tu-bs.de; milius@iti.cs.tu-bs.de
²  Department of Computer Science, University of Bremen, PO Box 330440, 28334 Bremen, Germany; luecke@tzi.de

(Received June 14, 2005. Accepted February 9, 2007. Published online 17 August 2007.)

Abstract
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