login
english version rss feed
Detailed view  Export this paper
Available versions:
hal-00451732, version 2
Computer Science/Other
Bulking I: an Abstract Theory of Bulking
Marianne Delorme1, Jacques Mazoyer1, Nicolas Ollinger2, Guillaume Theyssier3
1:  LIP - Laboratoire de l'Informatique du Parallélisme
2:  LIF - Laboratoire d'informatique Fondamentale de Marseille
3:  LAMA - Laboratoire de Mathématiques
This paper is the first part of a serie of two papers dealing with bulking: a quasiorder on cellular automata comparing space-time diagrams up to some rescaling. Bulking is a generalization of grouping taking into account universality phenomena, giving rise to a maximal equivalence class. In the present paper, we discuss the proper components of grouping and study the most general extensions. We identify the most general space-time transforms and give an axiomatization of bulking quasiorder. Finally, we study some properties of intrinsically universal cellular automata obtained by comparing grouping to bulking.
English
cellular automata – bulking – grouping – classification
Attached file list to this document: 
PDF
bulkI.pdf(688.5 KB)