A. Akhavi, I. Klimann, S. Lombardy, J. Mairesse, and M. Picantin, ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS, International Journal of Algebra and Computation, vol.22, issue.06, p.1250052, 2012.
DOI : 10.1142/S021819671250052X

URL : https://hal.archives-ouvertes.fr/hal-00695445

S. Amoroso and Y. N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, Journal of Computer and System Sciences, vol.6, issue.5, pp.448-464, 1972.
DOI : 10.1016/S0022-0000(72)80013-8

L. Bartholdi and P. V. Silva, Groups defined by automata, in AutoMathA handbook (to appear), https

M. Boyle and A. Maass, Expansive invertible onesided cellular automata, Journal of the Mathematical Society of Japan, vol.52, issue.4, pp.725-740, 2000.
DOI : 10.2969/jmsj/05240725

V. Bruyere, G. Hansel, C. Michaux, and R. Villemaire, Logic and p-recognizable sets of integers, Bulletin of the Belgian Mathematical Society Simon Stevin, vol.1, issue.2, pp.191-238, 1994.

E. Coven, M. Pivato, and R. Yassawi, Prevalence of odometers in cellular automata, Proceedings of the American Mathematical Society, vol.135, issue.03, pp.815-821, 2007.
DOI : 10.1090/S0002-9939-06-08754-5

P. Dartnell, A. Maass, and F. Schwartz, Combinatorial constructions associated to the dynamics of one-sided cellular automata, Theoretical Computer Science, vol.304, issue.1-3, pp.1-3, 2003.
DOI : 10.1016/S0304-3975(03)00290-1

M. Delorme, J. Mazoyer, N. Ollinger, and G. Theyssier, Bulking II: Classifications of cellular automata, Theoretical Computer Science, vol.412, issue.30, pp.3881-3905, 2011.
DOI : 10.1016/j.tcs.2011.02.024

URL : https://hal.archives-ouvertes.fr/hal-00451727

P. Gillibert, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, International Journal of Algebra and Computation, vol.24, issue.01, pp.1-9, 2014.
DOI : 10.1142/S0218196714500015

URL : https://hal.archives-ouvertes.fr/hal-00809295

V. M. Glushkov, THE ABSTRACT THEORY OF AUTOMATA, Russian Mathematical Surveys, vol.16, issue.5, pp.3-62, 1961.
DOI : 10.1070/RM1961v016n05ABEH004112

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

J. Kari and N. Ollinger, Periodicity and Immortality in Reversible Computing, Mathematical Foundations of Computer Science LNCS, vol.5162, pp.419-430, 2008.
DOI : 10.1007/978-3-540-85238-4_34

URL : https://hal.archives-ouvertes.fr/hal-00270815

J. Kari, The Nilpotency Problem of One-Dimensional Cellular Automata, SIAM Journal on Computing, vol.21, issue.3, pp.571-586, 1992.
DOI : 10.1137/0221036

J. Kari, Theory of cellular automata: A survey, Theoretical Computer Science, vol.334, issue.1-3, pp.3-33, 2005.
DOI : 10.1016/j.tcs.2004.11.021

I. Klimann, Automaton Semigroups: The Two-state Case, Theory of Computing Systems, pp.664-680, 2016.
DOI : 10.1007/s00224-014-9594-0

Z. ?uni? and E. Ventura, The conjugacy problem in automaton groups is not solvable, Journal of Algebra, vol.364, pp.148-154, 2012.
DOI : 10.1016/j.jalgebra.2012.04.014