2026-08-15T20:19:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2451 2024-03-06T10:33:22Z ddc:004 open_access

Ultimate Traces of Cellular Automata Cervelle, Julien Formenti, Enrico Guillon, Pierre Discrete dynamical systems cellular automata symbolic dynamics sofic systems formal languages decidability 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julien Cervelle and Enrico Formenti and Pierre Guillon 2010 Is Part Of LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2010.2451 urn:nbn:de:0030-drops-24518 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2451 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode