Ultimate Traces of Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Ultimate Traces of Cellular Automata

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : inria-00455807 , version 1

Cite

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⟩
193 View
131 Download

Share

Gmail Facebook X LinkedIn More