Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Cervelle, Julien; Formenti, Enrico; Guillon, Pierre http://www.dagstuhl.de/lipics License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-24518
URL:

; ;

Ultimate Traces of Cellular Automata

pdf-format:


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.

BibTeX - Entry

@InProceedings{cervelle_et_al:LIPIcs:2010:2451,
  author =	{Julien Cervelle and Enrico Formenti and Pierre Guillon},
  title =	{{Ultimate Traces of Cellular Automata}},
  booktitle =	{27th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{155--166},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-16-3},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{5},
  editor =	{Jean-Yves Marion and Thomas Schwentick},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2451},
  URN =		{urn:nbn:de:0030-drops-24518},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2451},
  annote =	{Keywords: Discrete dynamical systems, cellular automata, symbolic dynamics, sofic systems, formal languages, decidability}
}

Keywords: Discrete dynamical systems, cellular automata, symbolic dynamics, sofic systems, formal languages, decidability
Seminar: 27th International Symposium on Theoretical Aspects of Computer Science
Issue date: 2010
Date of publication: 2010


DROPS-Home | Fulltext Search | Imprint Published by LZI