| Journées Automates Cellulaires 2010 |  |
| Journées Automates Cellulaires 2010 | |
| HAL: hal-00542356, version 1 |
| arXiv: 1012.1333 |
| Detailed view |  Export this paper |
 |
| Journées Automates Cellulaires 2010, Turku : Finlande (2010) |
|
|
|
|
| Construction of µ-limit Sets |
|
|
| Laurent Boyer 1Martin Delacourt 2 |
|
|
| (2010-12-15) |
|
|
|
| The µ-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to infinity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as µ-limit set where µ is the uniform Bernoulli measure. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire de Mathématiques (LAMA) |
|
|
|
CNRS : UMR5127 – Université de Savoie |
|
|
| 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 d'Analyse, Topologie, Probabilités (LATP) |
|
|
|
CNRS : UMR6632 – Université de Provence - Aix-Marseille I – Université Paul Cézanne - Aix-Marseille III |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other |
|
|
| cellular automata – recursively enuerable subshift – limit set – measure-theoretic dynamical system |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00542356, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00542356 | |
| oai:hal.archives-ouvertes.fr:hal-00542356 | |
| From: Pierre Guillon | |
| Submitted on: Thursday, 2 December 2010 13:46:28 | |
| Updated on: Monday, 6 December 2010 13:10:51 | |
