Abstract
Permutation cellular automata are cellular automata defined by using finite maximal prefix codes. The overall dynamics of onesided and twosided permutation cellular automata is studied. For some classes of permutation cellular automata including the class of those defined by using finite maximal bifix codes, the overall dynamics is completely or partially described in terms of the codes used to define them.
Similar content being viewed by others
References
Aoki, N., Hiraide, K.: Topological Theory of Dynamical Systems. North-Holland, Amsterdam (1994)
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, San Diego (1985)
Blanchard, F., Maass, A.: Dynamical properties of expansive onesided cellular automata. Isr. J. Math. 99, 149–174 (1997)
Boyle, M.: Constraints on the degree of a sofic homomorphism and the induced multiplication of measures on unstable sets. Isr. J. Math. 53, 52–68 (1986)
Boyle, M., Fiebig, D., Fiebig, U.: A dimension group for local homeomorphisms and endomorphisms of onesided shifts of finite type. J. Reine Angew. Math. 487, 27–59 (1997)
Boyle, M., Kitchens, B.: Periodic points for onto cellular automata. Indag. Math. 10, 483–493 (1999)
Boyle, M., Maass, A.: Expansive invertible onesided cellular automata. J. Math. Soc. Jpn. 52, 725–740 (2000); Erratum, J. Math. Soc. Jpn. 56, 309–310 (2004)
Coven, E.: Topological entropy of block maps. Proc. Am. Math. Soc. 78, 590–594 (1980)
Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3, 320–375 (1969)
Jadur, C., Yazlle, J.: On the dynamics of cellular automata induced from a prefix code. Adv. Appl. Math. 38, 27–53 (2007)
Kitchens, B.: Continuity properties of factor maps in ergodic theory. Ph.D. Thesis, University of North Carolina, Chapel Hill (1981)
Kitchens, B.: Symbolic Dynamics, One-Sided, Two-Sided and Countable State Markov Shifts. Springer, Berlin (1998)
Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergod. Theory Dyn. Syst. 17, 417–433 (1997)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)
Nasu, M.: Local maps inducing surjective global maps of one-dimensional tessellation automata. Math. Syst. Theory 11, 327–351 (1978)
Nasu, M.: Constant-to-one and onto global maps of homomorphisms between strongly connected graphs. Ergod. Theory Dyn. Syst. 3, 387–413 (1983)
Nasu, M.: Topological conjugacy for sofic systems and extensions of automorphisms of finite subsystems of topological Markov shifts. In: Aexander, J.C. (ed.) Proceedings, University of Maryland 1986-87. Springer Lecture Notes in Math., vol. 1342, pp. 564–607. Springer, Berlin (1988)
Nasu, M.: Textile systems for endomorphisms and automorphisms of the shift. Mem. Am. Math. Soc. 546 (1995)
Nasu, M.: The dynamics of expansive invertible onesided cellular automata. Trans. Am. Math. Soc. 354, 4067–4084 (2002)
Nasu, M.: Nondegenerate q-biresolving textile systems and expansive automorphisms of onesided full shifts. Trans. Am. Math. Soc. 358, 871–891 (2006)
Nasu, M.: Textile systems and one-sided resolving automorphisms and endomorphisms of the shift. Ergod. Theory Dyn. Syst. 28, 167–209 (2008)
Nasu, M.: The degrees of onesided resolvingness and the limits of onesided resolving directions for endomorphisms and automorphisms of the shift. Preprint arXiv:1001.2157
Williams, R.F.: Classification of subshifts of finite type. Ann. Math. 98, 120–153 (1973); Errata: Ann. Math. 99, 380–381 (1974)
Acknowledgements
The authors thank the referee for many useful comments to improve the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Ki Hang Kim.
Rights and permissions
About this article
Cite this article
Jadur, C., Nasu, M. & Yazlle, J. Permutation Cellular Automata. Acta Appl Math 126, 203–243 (2013). https://doi.org/10.1007/s10440-013-9814-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10440-013-9814-7