On the Undecidability of Attractor Properties for Cellular Automata

Authors:
Pietro Di Lena;Luciano Margara
Affiliations:
(Correspd.) Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 40127 Bologna, Italy. dilena@cs.unibo.it;Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 40127 Bologna, Italy
Venue:
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Year:
2012

Citing 13
Cited 0

Undecidability of CA classification schemes

Complex Systems
The nilpotency problem of one-dimensional cellular automata

SIAM Journal on Computing
Rice's theorem for the limit sets of cellular automata

Theoretical Computer Science
Cellular automata and intermediate degrees

Theoretical Computer Science
Solution of some conjectures about topological properties of linear cellular automata

Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Fundamental study: Directional dynamics for cellular automata: A sensitivity to initial condition approach

Theoretical Computer Science
Computational complexity of dynamical systems: The case of cellular automata

Information and Computation
Conservation of some dynamical properties for operations on cellular automata

Theoretical Computer Science
Sand automata as cellular automata

Theoretical Computer Science
On the directional dynamics of additive cellular automata

Theoretical Computer Science
On the undecidability of the limit behavior of Cellular Automata

Theoretical Computer Science
A Search Algorithm for Subshift Attractors of Cellular Automata

Theory of Computing Systems - Special Issue: Theoretical Aspects of Computer Science; Guest Editors: Wolgang Thomas and Pascal Weil
Towards a rice theorem on traces of cellular automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The attractor properties in Cellular Automata dynamical systems have been extensively investigated and well characterized. We consider here two attractor classification for Cellular Automata and we prove the computational undecidability of some questions related to such classifications.