Clandestine Simulations in Cellular Automata

Abstract : This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity of attractors and factor subshifts. On the one hand, the factor simulation preserves the complexity of limits sets or column factors (the simulator CA must have a higher complexity than the simulated CA). On the other hand, we show that any CA is the sub-automaton of some CA with a simple limit set (NL-recognizable) and the sub-automaton of some CA with a simple column factor (finite type). As a corollary, we get intrinsically universal CA with simple limit sets or simple column factors. Hence we are able to 'hide' the simulation power of any CA under simple dynamical indicators.
Type de document :
Pré-publication, Document de travail
18 pages. 2010
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00521624
Contributeur : Pierre Guillon <>
Soumis le : samedi 13 novembre 2010 - 11:32:31
Dernière modification le : mercredi 1 juillet 2015 - 01:02:48
Document(s) archivé(s) le : vendredi 2 décembre 2016 - 23:12:20

Fichiers

simpluniv.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00521624, version 4
  • ARXIV : 1009.5621

Collections

LAMA | UGA

Citation

Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier. Clandestine Simulations in Cellular Automata. 18 pages. 2010. 〈hal-00521624v4〉

Partager

Métriques

Consultations de
la notice

232

Téléchargements du document

213