Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, February 11, 2010 - 11:44:46 AM
Last modification on : Thursday, August 4, 2022 - 4:53:43 PM
Long-term archiving on: : Friday, June 18, 2010 - 6:22:07 PM


Files produced by the author(s)


  • HAL Id : inria-00455807, version 1



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⟩



Record views


Files downloads