Luigi Acerbi, Alberto Dennunzio & Enrico Formenti (2009):
Conservation of some dynamical properties for operations on cellular automata..
Theor. Comput. Sci. 410(38-40),
pp. 3685–3693,
doi:10.1016/j.tcs.2009.05.004.
Nathalie Aubrun (2011):
Dynamique symbolique des systèmes 2D et des arbres infinis.
Université Paris-Est.
Nathalie Aubrun & Marie-Pierre Béal (2010):
Sofic and almost of finite type tree-shifts.
In: CSR 2010,
Lecture Notes in Comput. Sci. 6072.
Springer,
Berlin,
pp. 12–24,
doi:10.1007/978-3-642-13182-0_2.
F. Blanchard & A. Maass (1995):
On dynamical properties of generalized toggle automata.
In: Ricardo Baeza-Yates, Eric Goles & Patricio Poblete: LATIN '95: Theoretical Informatics,
Lecture Notes in Comput. Sci. 911.
Springer Berlin / Heidelberg,
pp. 84–98,
doi:10.1007/3-540-59175-3_83.
F. Blanchard & A. Maass (1997):
Dynamical properties of expansive one-sided cellular automata.
Isr. J. Math. 99,
pp. 149–174,
doi:10.1007/BF02760680.
Mike Boyle & Bruce Kitchens (1999):
Periodic points for onto cellular automata..
Indag. Math., New Ser. 10(4),
pp. 483–493,
doi:10.1016/S0019-3577(00)87901-X.
Gianpiero Cattaneo, Alberto Dennunzio & Luciano Margara (2002):
Chaotic subshifts and related languages. Applications to one-dimensional cellular automata..
Fundam. Inform. 52(1-3),
pp. 39–80.
Tullio Ceccherini-Silberstein & Michel Coornaert (2010):
Cellular Automata and Groups.
Springer Monographs in Mathematics. Berlin,
doi:10.1007/978-3-642-14034-1.
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi & Zoran Šuni\'c (2012):
Cellular automata on regular rooted trees.
In: CIAA 2012,
Lecture Notes in Comput. Sci. 7381.
Springer,
Berlin,
pp. 101–112.
Alberto Dennunzio & Enrico Formenti (2008):
Decidable properties of 2D cellular automata.
In: Developments in Language Theory,
Lecture Notes in Comput. Sci. 5257.
Springer,
pp. 264–275,
doi:10.1007/978-3-540-85780-8_21.
Alberto Dennunzio, Pierre Guillon & Benoît Masson (2009):
Sand automata as cellular automata..
Theor. Comput. Sci. 410(38-40),
pp. 3962–3974,
doi:10.1016/j.tcs.2009.06.016.
Francesca Fiorenzi (2000):
Cellular automata and finitely generated groups.
university of Rome ``La Sapienza''.
Francesca Fiorenzi (2000):
The Garden of Eden theorem for sofic shifts.
Pure Math. Appl. 11(3),
pp. 471–484.
Gustav A. Hedlund (1969):
Endomorphisms and automorphisms of the shift dynamical system.
Math. Systems Theory 3,
pp. 320–375,
doi:10.1007/BF01691062.
Petr Kůrka (1997):
Languages, equicontinuity and attractors in cellular automata..
Ergodic Theory Dyn. Syst. 17(2),
pp. 417–433,
doi:10.1017/S014338579706985X.
Petr Kůrka (2003):
Topological and symbolic dynamics.
Cours Spécialisés (Paris) 11. Paris: Société Mathématique de France. xii, 315 p..
Douglas A. Lind & Brian H. Marcus (1995):
An Introduction to Symbolic Dynamics and Coding.
Cambridge University Press,
Cambridge.
Edward F. Moore (1962):
Machine models of self-reproduction.
Proc. Symp. Applied Math. 14,
pp. 17–33.
John Myhill (1963):
The converse of Moore's Garden-of-Eden theorem.
Proc. Amer. Math. Soc. 14,
pp. 685–686,
doi:10.2307/2034301.
Mark A. Shereshevsky (1993):
Expansiveness, entropy and polynomial growth for groups acting on subshifts by automorphisms..
Indag. Math., New Ser. 4(2),
pp. 203–210,
doi:10.1016/0019-3577(93)90040-6.
Charalampos Zinoviadis (2010):
Dimension sensitive properties of cellular automata and subshifts of finite type.
Technical Report 977.
TUCS, University of Turku.