Abstract
We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidable if we restrict to regular cellular automata.
Please use the followiltg format when citiltg this chapter: Di Lena, P., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 185–196.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
F. Blanchard, A. Maass. Dynamical Behaviour of Coven’s Aperiodic Cellular Automata. Theor. Comput. Sci., 163, 291–302 (1996).
F. Blanchard, A. Maass. Dynamical properties of expansive one-sided cellular automata. Israel J. Math. 99, 149–174 (1997).
P. Di Lena. On Computing the Topological Entropy of one-sided Cellular Au-tomata. International Journal of Unconventional Computing (1995). To appear.
B. Durand, E. Formenti, G. Varouchas. On undecidability of equicontinuity classification for cellular automata. Discrete models for complex systems, DMCS ’03 (Lyon), 117–127 (2003).
R.H. Gilman, Robert H. Classes of linear automata. Ergodic Theory Dynam. Systems 7,no. 1, 105–118 (1987).
R.H. Gilman. Notes on Cellular Automata. Preprint (1988).
Hedlund, G. A. Endormorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–375 (1969).
L.P. Hurd, J. Kari, K. Culik. The topological entropy of cellular automata is uncomputable. Ergodic Theory Dynam. Sys. 12,no. 2, 255–265 (1992).
J. Hopcroft, J.D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley Series in Computer Science.Addison-Wesley Publishing Co., Reading, Mass. (1979).
Z. S. Jiang, H. M. Xie. Evolution complexity of the elementary cellular automaton rule 18. Complex Systems 13,no. 3, 271–295 (2001).
J. Karl. The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21,no. 3, 571–586 (1992).
P. Kůrka. Topological and symbolic dynamics. Cours Spécialisés [Specialized Courses], 11. Société Mathématique de France, Paris (2003).
P. Kůirka. Languages, equicontinuity and attractors in cellular automata. Ergodic Theory Dynamical Systems 17,no. 2, 417–433 (1997).
P. Kůrka. Zero-dimensional dynamical systems, formal languages, and universality. Theory Comput. Syst. 32,no. 4, 423–433 (1999).
D. Lind, B. Marcus. An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995).
J. von Neumann. Theory of self-reproducing automata. Univ. of Illinois Press, Urbana (1966).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Di Lena, P. (2006). Decidable Properties for Regular Cellular Automata. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)