HAL: hal-00451727, version 2

arXiv: 1001.5471

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

Available versions:

v2 (2010-09-24)

Bulking II: Classifications of Cellular Automata

Marianne Delorme 1, Jacques Mazoyer 1, Nicolas Ollinger 2, Guillaume Theyssier (  Corresponding author ) 3

(2010)

This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation between cellular automata and study the quasi-order structures induced by these simulation relations on the whole set of cellular automata. Various aspects of these quasi-orders are considered (induced equivalence relations, maximum elements, induced orders, etc) providing several formal tools allowing to classify cellular automata.

1:	Laboratoire de l'Informatique du Parallélisme (LIP)
	Université de Lyon – CNRS : UMR5668 – INRIA – École Normale Supérieure - Lyon – Université Claude Bernard - Lyon I
2:	Laboratoire d'informatique Fondamentale de Marseille (LIF)
	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
3:	Laboratoire de Mathématiques (LAMA)
	CNRS : UMR5127 – Université de Savoie

Subject

:

Computer Science/Discrete Mathematics

Keyword(s): cellular automata – bulking – grouping – classification

hal-00451727, version 2

http://hal.archives-ouvertes.fr/hal-00451727

oai:hal.archives-ouvertes.fr:hal-00451727

From: Guillaume Theyssier <>

Submitted on: Friday, 24 September 2010 15:33:24

Updated on: Friday, 24 September 2010 16:19:06