Ultimate Traces of Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Ultimate Traces of Cellular Automata

Résumé

A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their neighbors. Its trace is the set of infinite words representing the sequence of states taken by some particular cell. In this paper we study the ultimate trace of CA and partial CA (a CA restricted to a particular subshift). The ultimate trace is the trace observed after a long time run of the CA. We give sufficient conditions for a set of infinite words to be the trace of some CA and prove the undecidability of all properties over traces that are stable by ultimate coincidence.
Fichier principal
Vignette du fichier
cervelle.pdf (236.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00455807 , version 1 (11-02-2010)

Identifiants

  • HAL Id : inria-00455807 , version 1

Citer

Julien Cervelle, Enrico Formenti, Pierre Guillon. Ultimate Traces of Cellular Automata. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.155-166. ⟨inria-00455807⟩
195 Consultations
133 Téléchargements

Partager

Gmail Facebook X LinkedIn More