J. Almeida, Finite semigroups and universal algebra, volume 3 of Series in Algebra, 1994.

J. Almeida, Dynamics of implicit operations and tameness of pseudovarieties of groups, Trans. Amer. Math. Soc, vol.354, issue.1, pp.387-411, 2002.

J. Almeida, Finite semigroups: an introduction to a unified theory of pseudovarieties, Semigroups, Algorithms, Automata and Languages, pp.3-64, 2002.

J. Almeida, Profinite semigroups and applications, Structural theory of automata, semigroups, and universal algebra, vol.207, pp.1-45, 2005.

J. Almeida and A. Costa, Infinite-vertex free profinite semigroupoids and symbolic dynamics, J. Pure Appl. Algebra, vol.213, issue.5, pp.605-631, 2009.

J. Almeida and A. Costa, On the transition semigroups of centrally labeled Rauzy graphs, Internat. J. Algebra Comput, vol.22, issue.2, p.25, 2012.

J. Almeida and A. Costa, Presentations of Schützenberger groups of minimal subshifts, Israel J. Math, vol.196, issue.1, pp.1-31, 2013.

J. Almeida and A. Costa, A geometric interpretation of the Schützenberger group of a minimal subshift, Ark. Mat, vol.54, issue.2, pp.243-275, 2016.

J. Almeida and A. Costa, Equidivisible pseudovarieties of semigroups, Publ. Math. Debrecen, vol.90, pp.435-453, 2017.

J. Almeida, A. Costa, J. C. Costa, and M. Zeitoun, The linear nature of pseudowords, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02488361

J. Almeida, A. Costa, R. Kyriakoglou, and D. Perrin, On the group of a rational maximal bifix code. 17e journées montoises d'informatique théorique, 2018.

J. Almeida, A. Costa, R. Kyriakoglou, and D. Perrin, Profinite semigroups and symbolic dynamics

J. Almeida and B. Steinberg, Rational codes and free profinite monoids, J. Lond. Math. Soc, vol.79, issue.2, pp.465-477, 2009.

J. Almeida and M. Volkov, Subword complexity of profinite words and subgroups of free profinite semigroups. Internat, J. Algebra Comput, vol.16, pp.221-258, 2006.

. Zh and . Alme?da, Profinite groups associated with weakly primitive substitutions, Fundam. Prikl. Mat, vol.11, issue.3, pp.13-48, 2005.

L. Balková, E. Pelantová, and W. Steiner, Sequences with constant number of return words, Monatsh. Math, vol.155, issue.3-4, pp.251-263, 2008.

J. Berstel, C. De-felice, D. Perrin, C. Reutenauer, and G. Rindone, Bifix codes and Sturmian words, J. Algebra, vol.369, pp.146-202, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00793907

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00620616

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Acyclic, connected and tree sets, Monatshefte für Mathematik, vol.176, issue.4, pp.521-550, 2015.

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Bifix codes and interval exchanges, Journal of Pure and Applied Algebra, vol.219, issue.7, pp.2781-2798, 2015.

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., The finite index basis property, J. Pure Appl. Algebra, vol.219, issue.7, pp.2521-2537, 2015.

V. Berthé, C. De-felice, F. Dolce, J. Leroy, D. Perrin et al., Maximal bifix decoding, Dicrete Math, vol.338, pp.725-742, 2015.

S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Texts in Math, 1981.

J. Cassaigne, An algorithm to test if a given circular HD0L-language avoids a pattern, Information processing '94, vol.I, pp.459-464, 1994.

J. Cassaigne, Complexity and special factors. (complexit et facteurs spciaux, Bulletin of the Belgian Mathematical Society -Simon Stevin, vol.4, issue.1, pp.67-88, 1997.

C. Choffrut and J. Karhumäki, Combinatorics of words, Handbook of formal languages, vol.1, pp.329-438, 1997.

A. Costa, Conjugacy invariants of subshifts: an approach from profinite semigroup theory, IJAC, vol.16, pp.629-655, 2006.

A. Costa and B. Steinberg, Profinite groups associated to sofic shifts are free, Proc. Lond. Math. Soc, vol.102, issue.3, pp.341-369, 2011.

J. Costa, Free profinite locally idempotent and locally commutative semigroups, JPAA, vol.163, pp.19-47, 2001.

T. Coulbois, M. Sapir, and P. Weil, A note on the continuous extensions of injective morphisms between free groups to relatively free profinite groups, Publ. Mat, vol.47, issue.2, pp.477-487, 2003.

A. Distler and T. Kelsey, The semigroups of order 9 and their automorphism groups, Semigroup Forum, vol.88, pp.93-112, 2014.

A. Distler and J. D. Mitchell, The number of nilpotent semigroups of degree 3, Electron. J. Combin, vol.19, issue.2, pp.51-70, 2012.

F. Dolce and D. Perrin, Neutral and tree sets of arbitrary characteristic, Theoretical Computer Science, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01367718

F. Dolce and P. Perrin, Eventually dendric shifts, 2019.

F. Donce, R. Kyriakoglou, and J. Leroy, Decidable properties of extension graphs for substitutive languages, 2016.

X. Droubay, J. Justin, and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci, vol.255, issue.1-2, pp.539-553, 2001.

F. Durand, A characterization of substitutive sequences using return words, Discrete Mat, vol.179, pp.89-101, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00303319

F. Durand, B. Host, and D. Perrin, Dimension groups, 2019.
URL : https://hal.archives-ouvertes.fr/hal-00304369

F. Durand, B. Host, and C. Skau, Substitutional dynamical systems, bratteli diagrams and dimension groups, Ergodic Theory and Dynamical Systems, vol.19, issue.4, pp.953-993, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00304369

F. Durand and J. Leroy, The constant of recognizability is computable for primitive morphisms
URL : https://hal.archives-ouvertes.fr/hal-02455378

F. Durand, J. Leroy, and G. Richomme, Do the properties of an S-adic representation determine factor complexity?, J. Integer Seq, vol.16, issue.2, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00797654

A. Ehrenfeucht and G. Rozenberg, Elementary homomorphisms and a solution of the d0l sequence equivalence problem, Theoretical Computer Science, vol.7, issue.2, pp.169-183, 1978.

A. Ehrenfeucht and G. Rozenberg, Simplifications of homomorphisms, Inform. and Control, vol.38, issue.3, pp.298-309, 1978.

A. Ehrenfeucht and G. Rozenberg, Repetition of subwords in dol languages, Information and Control, vol.59, issue.1, pp.13-35, 1983.

, Samuel Eilenberg. Automata, Languages and Machines, 1974.

, Samuel Eilenberg. Automata, Languages and Machines, 1976.

N. and P. Fogg, Substitutions in dynamics, arithmetics and combinatorics, Lecture Notes in Mathematics, vol.1794

. Springer-verlag, , 2002.

A. E. Frid and S. V. Avgustinovich, On bispecial words and subword complexity of D0L sequences, Sequences and their Applications, pp.191-204, 1999.

D. Michael, M. Fried, and . Jarden, 11 of Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas

. Springer-verlag, , 2008.

A. Glen and J. Justin, Episturmian words: a survey, Theor. Inform. Appl, vol.43, pp.403-442, 2009.

J. Samuel, B. Van-gool, and . Steinberg, Pro-aperiodic monoids via saturated models, 2016.

M. Hall, Coset representations in free groups, Trans. Amer. Math. Soc, vol.67, pp.421-432, 1949.

M. Hall, A topology for free groups and related groups, Ann. of Math, vol.52, issue.2, pp.127-139, 1950.

T. Harju and M. Linna, On the periodicity of morphisms on free monoids, RAIRO, vol.20, pp.47-54, 1986.

W. Herfort, Introduction to profinite groups

H. Richard, I. F. Herman, C. F. Putnam, and . Skau, Ordered bratteli diagrams, dimension groups and topological dynamics, International Journal of Mathematics, vol.3, issue.06, pp.827-864, 1992.

A. Roger, C. R. Horn, and . Johnson, Matrix analysis. Cambridge University Press, 1990.

B. Host, Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable, Systems, vol.6, issue.4, pp.529-540, 1986.

S. Ito and Y. Takahashi, Markov subshifts and realization of ?-expansions, J. Math. Soc. Japan, vol.26, pp.33-55, 1974.

J. Justin and L. Vuillon, Return words in Sturmian and episturmian words, Theor. Inform. Appl, vol.34, issue.5, pp.343-356, 2000.

I. Kapovich and A. Myasnikov, Stallings foldings and subgroups of free groups, J. Algebra, vol.248, pp.608-668, 2002.

L. Kari, G. Rozenberg, and A. Salomaa, L systems, Handbook of formal languages, vol.1, pp.253-328, 1997.

K. Klouda, Bispecial factors in circular non-pushy d0l languages, Theor. Comput. Sci, vol.445, pp.63-74, 2012.

K. Klouda and K. Medková, Synchronizing delay for binary uniform morphisms, Theoretical Computer Science, vol.615, pp.12-22, 2016.

K. Klouda and . Starosta, Characterization of circular d0l-systems, Theoretical Computer Science, 2019.

D. E. Knuth, The art of computer programming, Seminumerical algorithms, vol.2, 1998.

N. Koblitz, p-adic numbers, p-adic analysis, and zetafunctions, Graduate Texts in Mathematics, vol.58, 1984.

P. K?rka, Topological and symbolic dynamics, Cours Spécialisés, vol.11

. Société-mathématique-de-france, , 2003.

R. Kyriakoglou and D. Perrin, , 2017.

G. Lallement, Semigroups and combinatorial applications, Pure and Applied Mathematics, 1979.

H. Lenstra, Profinite Fibonacci numbers, Nieuw Archief voor Wiskunde, vol.6, pp.297-300, 2005.

D. Lind and B. Marcus, An introduction to symbolic dynamics and coding, 1995.

M. Lothaire, Algebraic Combinatorics on Words, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00620608

C. Roger, P. E. Lyndon, and . Schupp, Combinatorial group theory. Classics in Mathematics, 2001.

S. Margolis, M. Sapir, and P. Weil, Irreducibility of certain pseudovarieties, Comm. Algebra, vol.26, issue.3, pp.779-792, 1998.

W. Stuart, M. Margolis, P. Sapir, and . Weil, Closed subgroups in pro-V topologies and the extension problem for inverse automata, Internat. J. Algebra Comput, vol.11, issue.4, pp.405-445, 2001.

J. C. Martin, Minimal flows arising from substitutions of non-constant length, Math. Systems Theory, vol.7, pp.72-82, 1973.

J. D. Mcknight, J. , and A. J. Storey, Equidivisible semigroups, J. Algebra, vol.12, pp.24-48, 1969.

F. Mignosi and P. Séébold, If a DOL language is k-power free then it is circular, Automata, languages and programming, vol.700, pp.507-518, 1993.

B. Mossé, Puissances de mots et reconnaissabilité des points fixes d'une substitution, Theoret. Comput. Sci, vol.99, issue.2, pp.327-334, 1992.

B. Mossé, Reconnaissabilité des substitutions et complexité des suites automatiques, Bull. Soc. Math. France, vol.124, issue.2, pp.329-346, 1996.

J. Pansiot, Decidability of periodicity for infinite words, RAIRO, vol.20, pp.43-46, 1986.

D. Perrin, Codes and automata in minimal sets, Combinatorics on Words -10th International Conference, pp.35-46, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01855957

, Infinite Word-sAutomata, Semigroups, Logic and Games, Pure and Applied Mathematics, vol.141, 2004.

J. Pin, Varieties of Formal Languages. Plenum, London, 1986.

J. Pin, Profinite methods in automata theory, 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp.31-50, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00359677

M. Queffélec, Substitution dynamical systems-spectral analysis, Lecture Notes in Mathematics, vol.1294

. Springer-verlag, , 1987.

C. Reutenauer, Une topologie du monoïde libre, Semigroup Forum, vol.18, pp.33-49, 1979.

J. Rhodes and B. Steinberg, The q-theory of finite semigroups, 2009.

L. Ribes and P. Zalesskii, Profinite groups, Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics, vol.40

. Springer-verlag, , 2010.

S. Satoh, K. Yama, and M. Tokizawa, Semigroups of order 8. SF, vol.49, pp.7-30, 1994.

M. Schtzenberger, On finite monoids having only trivial subgroups, Inform. and Control, vol.8, pp.190-194, 1965.

J. R. Stallings, Topology of finite graphs, Inventiones Mathematicae, vol.71, pp.551-565, 1983.

S. Willard, Reprint of the 1970 original, General topology, vol.0264581, 2004.

H. Yuasa, A review of Mossé's recognizability theorem. unpublished, 2014.