N. Aubrun and M. Béal, Decidability of Conjugacy of Tree-Shifts of Finite Type, ICALP '09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp.132-143, 2009.
DOI : 10.1007/978-3-642-02927-1_13
URL : https://hal.archives-ouvertes.fr/hal-00620305

N. Aubrun and M. Béal, Sofic and Almost of Finite Type Tree-Shifts, CSR, pp.12-24, 2010.
DOI : 10.1007/978-3-642-13182-0_2
URL : https://hal.archives-ouvertes.fr/hal-00620400

N. Aubrun and M. Béal, Tree-shifts of finite type, Theoretical Computer Science, vol.459, pp.16-25, 2012.
DOI : 10.1016/j.tcs.2012.07.020
URL : https://hal.archives-ouvertes.fr/hal-00627800

T. Bates, S. Eilers, and D. Pask, Reducibility of covers of AFT shifts, Israel Journal of Mathematics, vol.104, issue.1, pp.207-234, 2011.
DOI : 10.1007/s11856-011-0107-4

M. Béal, F. Fiorenzi, and D. Perrin, A hierarchy of shift equivalent sofic shifts, Theoretical Computer Science, vol.345, issue.2-3, pp.190-205, 2005.
DOI : 10.1016/j.tcs.2005.07.007

M. Béal and D. Perrin, Symbolic Dynamics and Finite Automata, Handbook of formal languages, pp.463-505, 1997.
DOI : 10.1007/978-3-662-07675-0_10

M. Boyle, B. Kitchens, and B. Marcus, A note on minimal covers for sofic systems, Proceedings of the American Mathematical Society, vol.95, issue.3, pp.403-411, 1985.
DOI : 10.1090/S0002-9939-1985-0806078-7

T. Ceccherini-silberstein, M. Coornaert, F. Fiorenzi, and Z. Sunic, Cellular Automata on Regular Rooted Trees, CIAA, pp.101-112, 2012.
DOI : 10.1007/978-3-642-31606-7_9
URL : https://hal.archives-ouvertes.fr/hal-00744256

E. Coven, A. Johnson, N. Jonoska, and K. Madden, The symbolic dynamics of multidimensional tiling systems, Ergodic Theory and Dynamical Systems, vol.23, issue.02, pp.447-460, 2003.
DOI : 10.1017/S014338570200113X

G. Fici and F. Fiorenzi, Topological properties of cellular automata on trees, DCM, pp.255-266, 2012.
DOI : 10.4204/EPTCS.90.20
URL : https://hal.archives-ouvertes.fr/hal-00946194

M. Fujiwara and M. Osikawa, Sofic systems and flow equivalence, Math. Rep. Kyushu Univ, vol.16, issue.1, pp.17-27, 1987.

G. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Theory of Computing Systems, pp.320-375, 1969.
DOI : 10.1007/BF01691062

A. S. Johnson and K. M. Madden, The decomposition theorem for two-dimensional shifts of finite type, Proc. Amer, pp.1533-1543, 1999.

N. Jonoska and B. Marcus, Minimal presentations for irreducible sofic shifts, IEEE Transactions on Information Theory, vol.40, issue.6, pp.1818-1825, 1994.
DOI : 10.1109/18.340457

B. P. Kitchens, Symbolic Dynamics. Universitext, Onesided , two-sided and countable state Markov shifts, 1998.

W. Krieger, On sofic systems I, Israel Journal of Mathematics, vol.98, issue.4, pp.305-330, 1984.
DOI : 10.1007/BF02760631

D. Lind and K. Schmidt, Chapter 10 Symbolic and algebraic dynamical systems, In Handbook of Dynamical Systems, vol.1, pp.765-812, 2002.
DOI : 10.1016/S1874-575X(02)80012-1

D. A. Lind and B. H. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

B. H. Marcus, Sofic systems and encoding data, IEEE Transactions on Information Theory, vol.31, issue.3, pp.31366-377, 1985.
DOI : 10.1109/TIT.1985.1057037

M. Nasu, Textile systems for endomorphisms and automorphisms of the shift, Memoirs of the American Mathematical Society, vol.114, issue.546, 1995.
DOI : 10.1090/memo/0546

J. Neumann, A. Szepietowski, and I. Walukiewicz, Complexity of weak acceptance conditions in tree automata, Information Processing Letters, vol.84, issue.4, pp.181-187, 2002.
DOI : 10.1016/S0020-0190(02)00285-5

D. Perrin and J. Pin, Infinite words, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

H. Seidl, On the finite degree of ambiguity of finite tree automata, Fundamentals of computation theory, pp.395-404, 1989.
DOI : 10.1007/3-540-51498-8_38

W. Thomas, Automata on Infinite Objects, In Handbook of Theoretical Computer Science, vol.B, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Languages, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.8502

J. Verdú-mas, R. Carrasco, and J. Calera-rubio, Parsing with probabilistic strictly locally testable tree languages, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.27, issue.7, pp.1040-1050, 2005.
DOI : 10.1109/TPAMI.2005.144

R. F. Williams, Classification of subshifts of finite type, Recent advances in topological dynamics (Proc. Conf. Topological Dynamics, pp.281-285, 1973.
DOI : 10.1007/BFb0061747

S. Williams, Covers of non-almost-finite type sofic systems, Proceedings of the American Mathematical Society, vol.104, issue.1, pp.245-252, 1988.
DOI : 10.1090/S0002-9939-1988-0958076-3