Finite semigroups and universal algebra, volume 3 of Series in Algebra, 1994. ,
Dynamics of implicit operations and tameness of pseudovarieties of groups, Trans. Amer. Math. Soc, vol.354, issue.1, pp.387-411, 2002. ,
Finite semigroups: an introduction to a unified theory of pseudovarieties, Semigroups, Algorithms, Automata and Languages, pp.3-64, 2002. ,
Profinite semigroups and applications, Structural theory of automata, semigroups, and universal algebra, vol.207, pp.1-45, 2005. ,
Infinite-vertex free profinite semigroupoids and symbolic dynamics, J. Pure Appl. Algebra, vol.213, issue.5, pp.605-631, 2009. ,
On the transition semigroups of centrally labeled Rauzy graphs, Internat. J. Algebra Comput, vol.22, issue.2, p.25, 2012. ,
Presentations of Schützenberger groups of minimal subshifts, Israel J. Math, vol.196, issue.1, pp.1-31, 2013. ,
A geometric interpretation of the Schützenberger group of a minimal subshift, Ark. Mat, vol.54, issue.2, pp.243-275, 2016. ,
Equidivisible pseudovarieties of semigroups, Publ. Math. Debrecen, vol.90, pp.435-453, 2017. ,
The linear nature of pseudowords, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-02488361
On the group of a rational maximal bifix code. 17e journées montoises d'informatique théorique, 2018. ,
Profinite semigroups and symbolic dynamics ,
Rational codes and free profinite monoids, J. Lond. Math. Soc, vol.79, issue.2, pp.465-477, 2009. ,
Subword complexity of profinite words and subgroups of free profinite semigroups. Internat, J. Algebra Comput, vol.16, pp.221-258, 2006. ,
Profinite groups associated with weakly primitive substitutions, Fundam. Prikl. Mat, vol.11, issue.3, pp.13-48, 2005. ,
Sequences with constant number of return words, Monatsh. Math, vol.155, issue.3-4, pp.251-263, 2008. ,
Bifix codes and Sturmian words, J. Algebra, vol.369, pp.146-202, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00793907
Codes and Automata, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00620616
Acyclic, connected and tree sets, Monatshefte für Mathematik, vol.176, issue.4, pp.521-550, 2015. ,
Bifix codes and interval exchanges, Journal of Pure and Applied Algebra, vol.219, issue.7, pp.2781-2798, 2015. ,
The finite index basis property, J. Pure Appl. Algebra, vol.219, issue.7, pp.2521-2537, 2015. ,
Maximal bifix decoding, Dicrete Math, vol.338, pp.725-742, 2015. ,
A Course in Universal Algebra, Texts in Math, 1981. ,
An algorithm to test if a given circular HD0L-language avoids a pattern, Information processing '94, vol.I, pp.459-464, 1994. ,
Complexity and special factors. (complexit et facteurs spciaux, Bulletin of the Belgian Mathematical Society -Simon Stevin, vol.4, issue.1, pp.67-88, 1997. ,
Combinatorics of words, Handbook of formal languages, vol.1, pp.329-438, 1997. ,
Conjugacy invariants of subshifts: an approach from profinite semigroup theory, IJAC, vol.16, pp.629-655, 2006. ,
Profinite groups associated to sofic shifts are free, Proc. Lond. Math. Soc, vol.102, issue.3, pp.341-369, 2011. ,
Free profinite locally idempotent and locally commutative semigroups, JPAA, vol.163, pp.19-47, 2001. ,
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. ,
The semigroups of order 9 and their automorphism groups, Semigroup Forum, vol.88, pp.93-112, 2014. ,
The number of nilpotent semigroups of degree 3, Electron. J. Combin, vol.19, issue.2, pp.51-70, 2012. ,
Neutral and tree sets of arbitrary characteristic, Theoretical Computer Science, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01367718
Eventually dendric shifts, 2019. ,
Decidable properties of extension graphs for substitutive languages, 2016. ,
Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci, vol.255, issue.1-2, pp.539-553, 2001. ,
A characterization of substitutive sequences using return words, Discrete Mat, vol.179, pp.89-101, 1998. ,
URL : https://hal.archives-ouvertes.fr/hal-00303319
Dimension groups, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-00304369
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
The constant of recognizability is computable for primitive morphisms ,
URL : https://hal.archives-ouvertes.fr/hal-02455378
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
Elementary homomorphisms and a solution of the d0l sequence equivalence problem, Theoretical Computer Science, vol.7, issue.2, pp.169-183, 1978. ,
Simplifications of homomorphisms, Inform. and Control, vol.38, issue.3, pp.298-309, 1978. ,
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.
Substitutions in dynamics, arithmetics and combinatorics, Lecture Notes in Mathematics, vol.1794 ,
, , 2002.
On bispecial words and subword complexity of D0L sequences, Sequences and their Applications, pp.191-204, 1999. ,
, 11 of Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas
, , 2008.
Episturmian words: a survey, Theor. Inform. Appl, vol.43, pp.403-442, 2009. ,
Pro-aperiodic monoids via saturated models, 2016. ,
Coset representations in free groups, Trans. Amer. Math. Soc, vol.67, pp.421-432, 1949. ,
A topology for free groups and related groups, Ann. of Math, vol.52, issue.2, pp.127-139, 1950. ,
On the periodicity of morphisms on free monoids, RAIRO, vol.20, pp.47-54, 1986. ,
Introduction to profinite groups ,
Ordered bratteli diagrams, dimension groups and topological dynamics, International Journal of Mathematics, vol.3, issue.06, pp.827-864, 1992. ,
Matrix analysis. Cambridge University Press, 1990. ,
Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable, Systems, vol.6, issue.4, pp.529-540, 1986. ,
Markov subshifts and realization of ?-expansions, J. Math. Soc. Japan, vol.26, pp.33-55, 1974. ,
Return words in Sturmian and episturmian words, Theor. Inform. Appl, vol.34, issue.5, pp.343-356, 2000. ,
Stallings foldings and subgroups of free groups, J. Algebra, vol.248, pp.608-668, 2002. ,
L systems, Handbook of formal languages, vol.1, pp.253-328, 1997. ,
Bispecial factors in circular non-pushy d0l languages, Theor. Comput. Sci, vol.445, pp.63-74, 2012. ,
Synchronizing delay for binary uniform morphisms, Theoretical Computer Science, vol.615, pp.12-22, 2016. ,
Characterization of circular d0l-systems, Theoretical Computer Science, 2019. ,
The art of computer programming, Seminumerical algorithms, vol.2, 1998. ,
p-adic numbers, p-adic analysis, and zetafunctions, Graduate Texts in Mathematics, vol.58, 1984. ,
Topological and symbolic dynamics, Cours Spécialisés, vol.11 ,
, , 2003.
, , 2017.
Semigroups and combinatorial applications, Pure and Applied Mathematics, 1979. ,
Profinite Fibonacci numbers, Nieuw Archief voor Wiskunde, vol.6, pp.297-300, 2005. ,
An introduction to symbolic dynamics and coding, 1995. ,
Algebraic Combinatorics on Words, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00620608
, Combinatorial group theory. Classics in Mathematics, 2001.
Irreducibility of certain pseudovarieties, Comm. Algebra, vol.26, issue.3, pp.779-792, 1998. ,
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. ,
Minimal flows arising from substitutions of non-constant length, Math. Systems Theory, vol.7, pp.72-82, 1973. ,
Equidivisible semigroups, J. Algebra, vol.12, pp.24-48, 1969. ,
If a DOL language is k-power free then it is circular, Automata, languages and programming, vol.700, pp.507-518, 1993. ,
Puissances de mots et reconnaissabilité des points fixes d'une substitution, Theoret. Comput. Sci, vol.99, issue.2, pp.327-334, 1992. ,
Reconnaissabilité des substitutions et complexité des suites automatiques, Bull. Soc. Math. France, vol.124, issue.2, pp.329-346, 1996. ,
Decidability of periodicity for infinite words, RAIRO, vol.20, pp.43-46, 1986. ,
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.
Varieties of Formal Languages. Plenum, London, 1986. ,
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
Substitution dynamical systems-spectral analysis, Lecture Notes in Mathematics, vol.1294 ,
, , 1987.
Une topologie du monoïde libre, Semigroup Forum, vol.18, pp.33-49, 1979. ,
The q-theory of finite semigroups, 2009. ,
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 ,
, , 2010.
, Semigroups of order 8. SF, vol.49, pp.7-30, 1994.
On finite monoids having only trivial subgroups, Inform. and Control, vol.8, pp.190-194, 1965. ,
Topology of finite graphs, Inventiones Mathematicae, vol.71, pp.551-565, 1983. ,
Reprint of the 1970 original, General topology, vol.0264581, 2004. ,
A review of Mossé's recognizability theorem. unpublished, 2014. ,