On the dynamics and recursive properties of multidimensional symbolic systems
- 285 Downloads
We study the (sub)dynamics of multidimensional shifts of finite type and sofic shifts, and the action of cellular automata on their limit sets. Such a subaction is always an effective dynamical system: i.e. it is isomorphic to a subshift over the Cantor set the complement of which can be written as the union of a recursive sequence of basic sets.
Our main result is that, to varying degrees, this recursive-theoretic condition is also sufficient. We show that the class of expansive subactions of multidimensional sofic shifts is the same as the class of expansive effective systems, and that a general effective system can be realized, modulo a small extension, as the subaction of a shift of finite type or as the action of a cellular automaton on its limit set (after removing a dynamically trivial set).
As applications, we characterize, in terms of their computational properties, the numbers which can occur as the entropy of cellular automata, and construct SFTs and CAs with various interesting properties.
- 1.Berger, R.: The undecidability of the domino problem. Mem. Am. Math. Soc. 66, 72 (1966)Google Scholar
- 4.Boyle, M., Schraudner, M.: Z d shifts of finite type without equal entropy full shift factors. J. Differ. Equ. Appl. (to appear)Google Scholar
- 6.Culik II, K., Hurd, L.P., Yu, S.: Computation theoretic aspects of cellular automata. Phys. D 45(1–3), 357–378 (1990); Cellular Automata: Theory and Experiment. Los Alamos, NM (1989)Google Scholar
- 10.Hochman, M., Meyerovitch, T.: A characterization of the entropies of multidimensional shifts of finite type. Ann. Math. (to appear)Google Scholar
- 23.von Neumann, J.: Theory of self-reproducing automata. University of Illinois Press, Urbana, London (1966)Google Scholar
- 27.Simpson, S.G.: Medvedev degrees of 2-dimensional subshifts of finite type. Preprint, www.math.psu.edu/simpson/papers/2dim.pdf (2007)Google Scholar
- 28.Sutner, K.: Universality and cellular automata. In: Machines, Computations, and Universality. Lect. Notes Comput. Sci., vol. 3354, pp. 50–59. Springer, Berlin (2005)Google Scholar
- 30.Wolfram, S.: Universality and complexity in cellular automata. Phys. D 10(1–2), 1–35 (1984); Cellular Automata. Los Alamos, N.M. (1983)Google Scholar