License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1819
URN: urn:nbn:de:0030-drops-18194
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1819/
Go to the corresponding LIPIcs Volume Portal

Di Lena, Pietro ; Margara, Luciano

Undecidable Properties of Limit Set Dynamics of Cellular Automata

pdf-format:
09001.DiLenaPietro.1819.pdf (0.2 MB)

Abstract

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial properties of limit sets are undecidable. In this paper we consider properties of limit set dynamics, i.e. properties of the dynamics of Cellular Automata restricted to their limit sets. There can be no equivalent of Kari's Theorem for limit set dynamics. Anyway we show that there is a large class of undecidable properties of limit set dynamics, namely all properties of limit set dynamics which imply stability or the existence of a unique subshift attractor. As a consequence we have that it is undecidable whether the cellular automaton map restricted to the limit set is the identity, closing, injective, expansive, positively expansive, transitive.

BibTeX - Entry

@InProceedings{dilena_et_al:LIPIcs:2009:1819,
  author =	{Pietro Di Lena and Luciano Margara},
  title =	{{Undecidable Properties of Limit Set Dynamics of Cellular Automata}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{337--348},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1819},
  URN =		{urn:nbn:de:0030-drops-18194},
  doi =		{10.4230/LIPIcs.STACS.2009.1819},
  annote =	{Keywords: Cellular automata, Undecidability, Symbolic dynamics}
}

Keywords: Cellular automata, Undecidability, Symbolic dynamics
Collection: 26th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2009
Date of publication: 19.02.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI