P. Arrighi and G. Dowek, Causal graph dynamics, In: Inf. Comput, vol.223, pp.78-93, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01361427

R. Samuel, L. Buss, and . Hay, On Truth-Table Reducibility to SAT, In: Inf. Comput. 91, vol.1, pp.86-102, 1991.

A. Stephen and . Cook, The Complexity of Theorem-proving Procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC '71, pp.151-158, 1971.

S. S. Dantchev, Dynamic Neighbourhood Cellular Automata, Visions of Computer Science -BCS International Academic Conference, pp.60-68, 2008.

J. Dubacq, Different Kinds of Neighborhood-Varying Cellular Automata, 1994.

O. H. Ibarra, Fast Parallel Language Recognition by Cellular Automata, In: Theor. Comput. Sci, vol.41, pp.231-246, 1985.

A. Ilachinski and P. Halpern, Structurally Dynamic Cellular Automata, In: Complex Systems, vol.1, issue.3, pp.503-527, 1987.

S. Kim and R. Mccloskey, A Characterization of Constant-Time Cellular Automata Computation, In: Phys. D, vol.45, pp.404-419, 1990.

M. Kutrib, In: Encyclopedia of Complexity and Systems Science, pp.800-823, 2009.

M. Kutrib, Shrinking One-Way Cellular Automata, Cellular Automata and Discrete Complex Systems -21st IFIP WG 1.5 International Workshop, pp.141-154, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01442469

R. E. Ladner and N. A. Lynch, Relativization of Questions About Log Space Computability, In: Mathematical Systems Theory, vol.10, pp.19-32, 1976.

R. E. Ladner, A Comparison of Polynomial Time Reducibilities, In: Theor. Comput. Sci, vol.1, issue.2, pp.103-123, 1975.

A. Modanese, Complexity-Theoretical Aspects of Expanding Cellular Automata, 2018.

A. Modanese, Shrinking and Expanding One-Dimensional Cellular Automata, 2016.

A. Modanese and T. Worsch, Shrinking and Expanding Cellular Automata, Cellular Automata and Discrete Complex Systems22nd IFIP WG 1.5 International Workshop, AUTOMATA 2016, pp.159-169, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01435026

A. Rosenfeld, Picture languages, 1979.

A. Rosenfeld and A. Y. Wu, Reconfigurable Cellular Computers, In: Information and Control, vol.50, pp.60-84, 1981.

A. Rosenfeld, Fast language acceptance by shrinking cellular automata, Inf. Sci, vol.30, issue.1, pp.47-53, 1983.

A. Smith and I. , Simple Computation-Universal Cellular Spaces, In: J. ACM, vol.18, pp.339-353, 1971.

R. Sommerhalder and S. Christian-van-westrhenen, Parallel Language Recognition in Constant Time by Cellular Automata, In: Acta Inf, vol.19, pp.397-407, 1983.

K. Tomita, Graph automata: natural expression of self-reproduction, In: Physica D: Nonlinear Phenomena, vol.171, pp.197-210, 2002.

K. W. Wagner, Bounded Query Classes, In: SIAM J. Comput, vol.19, pp.833-846, 1990.