Nilpotency and Limit Sets of Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Nilpotency and Limit Sets of Cellular Automata

Résumé

A one-dimensional cellular automaton is a dynamical system which consisting in a juxtaposition of cells whose state changes over discrete time according to that of their neighbors. One of its simplest behaviors is nilpotency: all con gurations of cells are mapped after a nite time into a given \null" con guration. Our main result is that nilpotency is equivalent to the condition that all con gurations converge towards the null con guration for the Cantor topology, or, equivalently, that all cells of all con gurations asymptotically reach a given state.
Fichier principal
Vignette du fichier
hal.pdf (140.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00620283 , version 1 (03-10-2011)

Identifiants

  • HAL Id : hal-00620283 , version 1

Citer

Pierre Guillon, Gaétan Richard. Nilpotency and Limit Sets of Cellular Automata. 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS'08), Aug 2008, Toruń, Poland, Poland. pp.375-386. ⟨hal-00620283⟩
271 Consultations
154 Téléchargements

Partager

Gmail Facebook X LinkedIn More