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.
Document type :
Conference papers
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.155-166, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées


https://hal.inria.fr/inria-00455807
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 11:44:46 AM
Last modification on : Monday, March 21, 2016 - 11:33:52 AM
Document(s) archivé(s) le : Friday, June 18, 2010 - 6:22:07 PM

File

cervelle.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455807, version 1

Collections

Citation

Julien Cervelle, Enrico Formenti, Pierre Guillon. Ultimate Traces of Cellular Automata. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.155-166, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. <inria-00455807>

Share

Metrics

Record views

199

Document downloads

100