论文信息 - Sofic Trace Subshift of a Cellular Automaton - 字舞流文

Sofic Trace Subshift of a Cellular Automaton

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. In this paper we study conditions for a sofic subshift to be the trace of a cellular automaton.

Pierre Guillon | Enrico Formenti | Julien Cervelle

[1] P. Kurka. Languages, equicontinuity and attractors in cellular automata , 1997, Ergodic Theory and Dynamical Systems.

[2] Gianpiero Cattaneo,et al. Pattern Growth in Elementary Cellular Automata , 1995, Theor. Comput. Sci..

[3] Mike Hurley. Attractors in cellular automata , 1990 .

[4] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

[5] B. Weiss. Subshifts of finite type and sofic systems , 1973 .

[6] Robert H. Gilman. Classes of linear automata , 1987 .

[7] Enrico Formenti,et al. Kolmogorov complexity and cellular automata classification , 2001, Theor. Comput. Sci..

[8] Enrico Formenti,et al. On undecidability of equicontinuity classification for cellular automata , 2003, DMCS.

[9] Karel Culik,et al. Undecidability of CA Classification Schemes , 1988, Complex Syst..

[10] G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.