Abstract
ν-CA are cellular automata which can have different local rules at each site of their lattice. Indeed, the spatial distribution of local rules completely characterizes ν-CA. In this paper, sets of distributions sharing some interesting properties are associated with languages of bi-infinite words. The complexity classes of these languages are investigated providing an initial rough classification of ν-CA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comput. Syst. Sci. 6(5), 448–464 (1972)
Berstel, J., Perrin, D.: Theory of Codes. Academic Press (1985)
Cattaneo, G., Dennunzio, A., Formenti, E., Provillard, J.: Non-Uniform Cellular Automata. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 302–313. Springer, Heidelberg (2009)
Chaudhuri, P., Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and Applications, vol. 1. IEEE Press (1997)
Dennunzio, A., Formenti, E., Provillard, J.: Local rule distributions, language complexity and non-uniform cellular automata. ArXiv e-prints (2011)
Dennunzio, A., Formenti, E., Provillard, J.: Non-uniform cellular automata: classes, dynamics, and decidability. ArXiv e-prints (2011)
Devaney, R.L.: An Introduction to Chaotic Dynamical Systems, 2nd edn. Westview Pr., Short Disc (2003)
Durand, B., Formenti, E., Róka, Z.: Number-conserving cellular automata I: decidability. Theoretical Computer Science 299(1-3), 523–535 (2003)
Durand, B., Formenti, E., Varouchas, G.: On Undecidability of Equicontinuity Classification for Cellular Automata. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 117–128. Springer, Heidelberg (2003)
Fúster-Sabater, A., Caballero-Gil, P., Pazo-Robles, M.E.: Application of Linear Hybrid Cellular Automata to Stream Ciphers. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 564–571. Springer, Heidelberg (2007)
Gerlee, P., Anderson, A.R.A.: Stability analysis of a hybrid cellular automaton model of cell colony growth. Phys. Rev. E 75, 051911 (2007)
Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Theory of Computing Systems 3(4), 320–375 (1969)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley (2006)
Kari, J.: Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences 48, 149–182 (1994)
Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory and Dynamical Systems 17(2), 417–433 (1997)
Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, New York (1995)
Litovsky, I., Staiger, L.: Finite acceptance of infinite words. Theoretical Computer Science 174, 1–21 (1997)
Manzini, G., Margara, L.: A complete and efficiently computable topological classification of d-dimensional linear cellular automata over Zm. Theoretical Computer Science 221(1-2), 157–177 (1999)
Moore, E.F.: Machine models of self-reproduction. In: Proceedings of Symposia in Applied Mathematics, vol. 14, pp. 17–33 (1962)
Myhill, J.: The converse of Moore’s garden-of-Eden theorem. Proceedings of the American Mathematical Society 14(4), 685–686 (1963)
Nivat, M., Perrin, D.: Ensembles reconnaissables de mots biinfinis. In: STOC, pp. 47–59. ACM (1982)
Perrin, D., Pin, J.E.: Infinite Words, Pure and Applied Mathematics, vol. 141. Elsevier (2004)
Sutner, K.: De Bruijn graphs and linear cellular automata. Complex Systems 5, 19–30 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dennunzio, A., Formenti, E., Provillard, J. (2012). Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-28332-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28331-4
Online ISBN: 978-3-642-28332-1
eBook Packages: Computer ScienceComputer Science (R0)