论文信息 - Limit Sets of Stable and Unstable Cellular Automata

Limit Sets of Stable and Unstable Cellular Automata

We construct a cellular automaton (CA) with a sofic and mixing limit set and then construct a stable CA with the same limit set, showing there exist subshifts that can be limit sets of both stable and unstable CAs, answering a question raised by A. Maass.

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

[2] Alejandro Maass,et al. On the sofic limit sets of cellular automata , 1995, Ergodic Theory and Dynamical Systems.

[3] Enrico Formenti,et al. Subshift attractors of cellular automata , 2007 .

[4] Lyman P. Hurd,et al. Nonrecursive Cellular Automata Invariant Sets , 1990, Complex Systems.

[5] Jarkko Kari. Rice's Theorem for the Limit Sets of Cellular Automata , 1994, Theor. Comput. Sci..

[6] Karel Culik,et al. On the Limit Sets of Cellular Automata , 1989, SIAM J. Comput..

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

[8] Jonathan Ashley. An extension theorem for closing maps of shifts of finite type , 1993 .

[9] Lyman P. Hurd. Formal Language Characterization of Cellular Automaton Limit Sets , 1987, Complex Syst..

[10] Mike Boyle. Lower entropy factors of sofic systems , 1983 .

[11] Mike Boyle,et al. OPEN PROBLEMS IN SYMBOLIC DYNAMICS , 2008 .

[12] Lyman P. Hurd,et al. Recursive Cellular Automata Invariant Sets , 1990, Complex Syst..

[13] Pietro Di Lena,et al. Undecidable Properties of Limit Set Dynamics of Cellular Automata , 2009, STACS.