Revisiting the Rice Theorem of Cellular Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Revisiting the Rice Theorem of Cellular Automata

Pierre Guillon
Connectez-vous pour contacter l'auteur
Gaétan Richard


A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton is the set of configurations which can be reached arbitrarily late in the evolution. In this paper, we prove that all properties of limit sets of cellular automata with binary-state cells are undecidable, except surjectivity. This is a refinement of the classical "Rice Theorem" that Kari proved on cellular automata with arbitrary state sets.
Fichier principal
Vignette du fichier
guillon.pdf (209.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455736 , version 1 (11-02-2010)


  • HAL Id : inria-00455736 , version 1


Pierre Guillon, Gaétan Richard. Revisiting the Rice Theorem of Cellular Automata. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.441-452. ⟨inria-00455736⟩
169 View
190 Download


Gmail Facebook X LinkedIn More