Abstract
We discuss groups and monoids defined by cellular automata on full shifts, sofic shifts, minimal subshifts, countable subshifts and coded and synchronized systems. Both purely group-theoretic properties and issues of decidability are considered.
The author was supported by FONDECYT Grant 3150552.
Chapter PDF
Similar content being viewed by others
References
Aubrun, N., Sablik, M.: Simulation of effective subshifts by two-dimensional subshifts of finite type. Acta Appl. Math. 126(1), 35–63 (2013)
Belk, J., Bleak, C.: Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V. ArXiv e-prints, May 2014
Boyle, M., Lind, D., Rudolph, D.: The automorphism group of a shift of finite type. Transactions of the American Mathematical Society 306(1), 71–114 (1988)
Belk, J., Matucci, F.: Conjugacy and dynamics in thompson’s groups. Geometriae Dedicata 169(1), 239–261 (2014)
Bowen, L.: Measure conjugacy invariants for actions of countable sofic groups. Journal of the American Mathematical Society 23(1), 217–245 (2010)
Boyle, M.: Open problems in symbolic dynamics. In: Geometric and Probabilistic Structures in Dynamics. Contemp. Math., vol. 469, pp. 69–118. Amer. Math. Soc., Providence (2008)
Cyr, V., Kra, B.: The automorphism group of a shift of subquadratic growth. ArXiv e-prints, March 2014
Coven, E.M.: Endomorphisms of substitution minimal sets. Probability Theory and Related Fields 20(2), 129–133 (1971)
Coven, E., Yassawi, R.: Endomorphisms and automorphisms of minimal symbolic systems with sublinear complexity. ArXiv e-prints, November 2014
Donoso, S., Durand, F., Maass, A., Petite, S.: On automorphism groups of low complexity minimal subshifts (2014)
Durand, F., Host, B., Skau, C.: Substitutional dynamical systems, Bratteli diagrams and dimension groups. Ergodic Theory Dynam. Systems 19(4), 953–993 (1999)
Durand, B., Romashchenko, A., Shen, A.: Fixed-point tile sets and their applications. J. Comput. System Sci. 78(3), 731–764 (2012)
Durand, F.: Linearly recurrent subshifts have a finite number of non-periodic subshift factors. Ergodic Theory and Dynamical Systems 20, 1061–1078 (2000)
Fiebig, D., Fiebig, U.-R.: The automorphism group of a coded system. Transactions of the American Mathematical Society 348(8), 3173–3191 (1996)
Gajardo, A., Kari, J., Moreira, A.: On time-symmetry in cellular automata. Journal of Computer and System Sciences 78(4), 1115–1126 (2012)
Grigorchuk, R.I.: Degrees of growth of finitely generated groups, and the theory of invariant means. Mathematics of the USSR-Izvestiya 25(2), 259 (1985)
Guillon, P.: Projective subdynamics and universal shifts. In: 17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011, Center for Mathematical Modeling, University of Chile, Santiago, November 21–23, 2011, pp. 123–134 (2011)
Guillon, P., Zinoviadis, C.: Densities and entropies in cellular automata. ArXiv e-prints, April 2012
Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3, 320–375 (1969)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)
Hochman, M.: On the automorphism groups of multidimensional shifts of finite type. Ergodic Theory Dynam. Systems 30(3), 809–840 (2010)
Host, B., Parreau, F.: Homomorphismes entre systèmes dynamiques définis par substitutions. Ergodic Theory and Dynamical Systems 9, 469–477 (1989)
Kari, J.: Reversibility of 2d cellular automata is undecidable. Physica D: Nonlinear Phenomena 45(1–3), 379–385 (1990)
Kari, J.: Decidability and undecidability in cellular automata. Int. J. General Systems 41(6), 539–554 (2012)
Kitchens, B.P.: Symbolic dynamics - One-sided, two-sided and countable state Markov shifts. Universitext. Springer-Verlag, Berlin (1998)
Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419–430. Springer, Heidelberg (2008)
Kim, K.H., Roush, F.W.: On the automorphism groups of subshifts. Pure Mathematics and Applications 1(4), 203–230 (1990)
Kim, K.H., Roush, F.W.: Solution of two conjectures in symbolic dynamics. Proceedings of the American Mathematical Society 112(4), 1163–1168 (1991)
Kůrka, P.: Topological and symbolic dynamics. Cours Spécialisés [Specialized Courses], vol. 11. Société Mathématique de France, Paris (2003)
Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge (1995)
Lothaire, M.: Algebraic combinatorics on words. Encyclopedia of Mathematics and its Applications, vol. 90. Cambridge University Press, Cambridge (2002)
Olshanskii, A.Y.: On a geometric method in the combinatorial group theory. In: Proceedings of the International Congress of Mathematicians, pp. 415–424 (1983)
Rotman, J.J.: An introduction to the theory of groups, vol. 148. Springer Science & Business Media (1995)
Patrick Ryan, J.: The shift and commutativity. Mathematical systems theory 6(1–2), 82–85 (1972)
Salo, V.: Toeplitz subshift whose automorphism group is not finitely generated. ArXiv e-prints, November 2014
Salo, V.: Subshifts with Simple Cellular Automata. Ph.D. thesis (2014)
Salo, V., Törmä, I.: Computational aspects of cellular automata on countable sofic shifts. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 777–788. Springer, Heidelberg (2012)
Salo, V., Törmä, I.: Constructions with countable subshifts of finite type. Fundam. Inf. 126(2–3), 263–300 (2013)
Salo, V., Törmä, I.: Block maps between primitive uniform and pisot substitutions. Ergodic Theory and Dynamical Systems FirstView, 1–19 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Salo, V. (2015). Groups and Monoids of Cellular Automata. In: Kari, J. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2015. Lecture Notes in Computer Science(), vol 9099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47221-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-47221-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47220-0
Online ISBN: 978-3-662-47221-7
eBook Packages: Computer ScienceComputer Science (R0)