C. Berge, Topological spaces Including a treatment of multi-valued functions, vector spaces and convexity, 1963.

E. Burkhead and J. M. Hawkins, Nondeterministic and stochastic cellular automata and virus dynamics, J. Cell. Autom, 2016.

A. Dennunzio, D. Lena, P. Formenti, E. Margara, and L. , On the directional dynamics of additive cellular automata, Theoretical Computer Science, vol.410, issue.47-49, pp.4823-4833, 2009.
DOI : 10.1016/j.tcs.2009.06.023

A. Dennunzio, E. Formenti, L. Manzoni, and G. Mauri, m-Asynchronous cellular automata: from fairness to quasi-fairness, Natural Computing, vol.51, issue.2, pp.561-572, 2013.
DOI : 10.1016/S0303-2647(99)00025-8
URL : https://hal.archives-ouvertes.fr/hal-01312569

A. Dennunzio, E. Formenti, and J. Provillard, Local rule distributions, language complexity and non-uniform cellular automata, Theoretical Computer Science, vol.504, pp.38-51, 2013.
DOI : 10.1016/j.tcs.2012.05.013
URL : https://hal.archives-ouvertes.fr/hal-01297610

A. Dennunzio, D. Lena, P. Formenti, E. Margara, and L. , Periodic Orbits and Dynamical Complexity in Cellular Automata, Fundam. Inform, vol.126, pp.183-199, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01312658

A. Dennunzio, E. Formenti, and M. Weiss, Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues, Theoretical Computer Science, vol.516, pp.40-59, 2014.
DOI : 10.1016/j.tcs.2013.11.005
URL : https://hal.archives-ouvertes.fr/hal-01313574

A. Dennunzio, E. Formenti, L. Manzoni, G. Mauri, and A. E. Porreca, Computational complexity of finite asynchronous cellular automata, Theoretical Computer Science, vol.664, pp.131-143, 2017.
DOI : 10.1016/j.tcs.2015.12.003

D. Lena and P. , Decidable properties for regular cellular automata, Fourth IFIP International Conference on Theoretical computer Science, pp.185-196, 2006.

D. Lena, P. Margara, and L. , Computational complexity of dynamical systems: The case of cellular automata, Information and Computation, vol.206, issue.9-10, pp.1104-1116, 2008.
DOI : 10.1016/j.ic.2008.03.012

D. Lena, P. Margara, and L. , On the undecidability of the limit behavior of Cellular Automata, Theoretical Computer Science, vol.411, issue.7-9, pp.1075-1084, 2010.
DOI : 10.1016/j.tcs.2009.11.016

D. Lena, P. Margara, and L. , On the Undecidability of Attractor Properties for Cellular Automata, Fund. Inform, vol.115, pp.78-85, 2012.

D. Lena, P. Margara, and L. , Nondeterministic Cellular Automata, Information Sciences, vol.287, pp.13-25, 2014.
DOI : 10.1016/j.ins.2014.07.007
URL : https://hal.archives-ouvertes.fr/hal-01656361

H. Furusawa, T. Ishida, and Y. Kawahara, Continuous Relations and Richardson's Theorem (eds) Relational and Algebraic Methods in Computer Science, Lecture Notes in Computer Science, vol.7560, 2012.

H. Furusawa, Uniform continuity of relations and nondeterministic cellular automata, Theoretical Computer Science, vol.673, 2016.
DOI : 10.1016/j.tcs.2017.02.004

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969.
DOI : 10.1090/coll/036

P. K?rka, Languages, equicontinuity and attractors in cellular automata, Ergodic Theory and Dynamical Systems, vol.17, issue.2, pp.417-433, 1997.
DOI : 10.1017/S014338579706985X

P. K?rka, Topological and Symbolic Dynamics, Cours Spécialisés, vol.11, 2003.

Y. Ozhigov, Computations on Nondeterministic Cellular Automata, Information and Computation, vol.148, issue.2, pp.181-201, 1999.
DOI : 10.1006/inco.1998.2741

D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences, vol.6, issue.5, pp.373-388, 1972.
DOI : 10.1016/S0022-0000(72)80009-6

T. Yaku, Surjectivity of nondeterministic parallel maps induced bynondeterministic cellular automata, Journal of Computer and System Sciences, vol.12, issue.1, pp.1-5, 1976.
DOI : 10.1016/S0022-0000(76)80013-X