Abstract
Cellular automata are a parallel and synchronous computing model, made of infinitely many finite automata updating according to the same local rule. Rice’s theorem states that any nontrivial property over computable functions is undecidable. It has been adapted by Kari to limit sets of cellular automata [7], that is the set of configurations that can be reached arbitrarily late. This paper proves a new Rice theorem for μ-limit sets, which are sets of configurations often reached arbitrarily late.
Thanks to the project ANR EMC: ANR-09-BLAN-0164.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boyer, L., Delacourt, M., Sablik, M.: Construction of μ-limit sets. In: Kari, J. (ed.) JAC 2010, vol. 13, pp. 76–87. TUCS Lecture notes, Turku (2010)
Boyer, L., Poupet, V., Theyssier, G.: On the complexity of limit sets of cellular automata associated with probability measures. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 190–201. Springer, Heidelberg (2006)
Delacourt, M., Poupet, V., Sablik, M., Theyssier, G.: Directional dynamics along arbitrary curves in cellular automata. To be Pubished in Theoretical Computer Science (2011)
Fredricksen, H., Kessler, I.: Lexicographic compositions and debruijn sequences. Journal of Combinatorial Theory, Series A 22(1), 17–30 (1977)
Guillon, P., Richard, G.: Revisiting the rice theorem of cellular automata. In: Marion, J.Y., Schwentick, T. (eds.) STACS 2010, vol. 5, pp. 441–452. LIPIcs, Schloss Dagstuhl (2010)
Hurley, M.: Ergodic aspects of cellular automata. Ergodic Theory and Dynamical Systems 10, 671–685 (1990)
Kari, J.: Rice’s theorem for the limit sets of cellular automata. Theoretical Computer Science 127(2), 229–254 (1994)
Kůrka, P., Maass, A.: Limit sets of cellular automata associated to probability measures. Journal of Statistical Physics 100, 1031–1047 (2000)
von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Champaign (1966)
Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society 74(2), 358–366 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delacourt, M. (2011). Rice’s Theorem for μ-Limit Sets of Cellular Automata. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-22012-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22011-1
Online ISBN: 978-3-642-22012-8
eBook Packages: Computer ScienceComputer Science (R0)