Tree-shifts of finite type, Theoret. Comput. Sci, vol.459, pp.16-25, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00627800
Bifix codes and Sturmian words, J. Algebra, vol.369, pp.146-202, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00793907
Beyond substitutive dynamical systems: S-adic expansions, pp.81-123 ,
Selfdual substitutions in dimension one, European J. of Combinatorics, vol.33, pp.981-1000, 2012. ,
Initial powers of Sturmian sequences, Acta Arith, vol.122, pp.315-347, 2006. ,
On substitution invariant Sturmian words: an application of Rauzy fractals, Theoret. Informatics Appl, vol.41, pp.329-349, 2007. ,
Acyclic, connected and tree sets, Monatsh. Math, vol.176, pp.521-550, 2015. ,
Maximal bifix decoding, Discrete Math, vol.338, pp.725-742, 2015. ,
The finite index basis property, J. Pure Appl. Algebra, vol.219, pp.2521-2537, 2015. ,
Weak mixing and eigenvalues for Arnoux-Rauzy sequences, Ann. Inst. Fourier (Grenoble), vol.58, pp.1983-2005, 2008. ,
The spectrum of dynamical systems arising from substitutions of constant length, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete, pp.221-239, 1977. ,
Some remarks about stabilizers, Theoret. Comput. Sci, vol.410, pp.2935-2946, 2009. ,
Decidable properties of extension graphs for substitutive languages, 16th Mons Theoretical Computer Science Days ,
Neutral and tree sets of arbitrary characteristic, Theoretical Computer Science, vol.658, pp.159-174, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01367718
Survey of odometers and Toeplitz flows, Algebraic and topological dynamics, Contemp. Math, vol.385, pp.7-37, 2005. ,
A characterization of substitutive sequences using return words, Dicrete Math, vol.179, pp.89-101, 1998. ,
URL : https://hal.archives-ouvertes.fr/hal-00303319
Linearly recurrent subshifts have a finite number of non-periodic subshift factors, Ergodic Theory & Dynam, Systems, vol.20, pp.663-669, 2000. ,
Cobham's theorem for substitutions, J. Eur. Math. Soc, pp.1799-1814, 2011. ,
HD0L ?-equivalence and periodicity problems in the primitive case, Unif. Distrib. Theory, vol.7, pp.199-215, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00637324
Syndeticity and independent substitutions, Adv. Appl. Math, vol.42, pp.1-22, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00407667
Do the properties of an S-adic representation determine factor complexity, J. of Integer Sequences, vol.16, pp.13-15, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00797654
, Substitutions in dynamics, arithmetics and combinatorics, p.1794, 2002.
Non topologically weakly mixing interval exchanges, Discrete Contin. Dyn. Syst, vol.27, pp.1079-1091, 2010. ,
Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable, Ergodic Theory Dynam. Systems, vol.6, pp.529-540, 1986. ,
On stabilizers of infinite words, Theoret. Comput. Sci, vol.400, pp.169-181, 2008. ,
Some improvements of the S-adic conjecture, Adv. in Appl. Math, vol.48, pp.79-98, 2012. ,
An S-adic characterization of minimal subshifts with first difference of complexity 1 ? p(n + 1) ? p(n) ? 2, Discrete Math. Theor. Comput. Sci, vol.16, pp.233-286, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01179422
A combinatorial proof of S-adicity for sequences with linear complexity, Integers, vol.13, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00797658
, Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol.90, 2002.
, , 2004.
Morphismes sturmiens et règles de Rauzy, J. Théor. Nombres Bordeaux, vol.5, pp.221-233, 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. ,
Strong orbit realization for minimal homeomorphisms, J. Anal. Math, vol.71, pp.103-133, 1997. ,
A decidable property of iterated morphisms, Theoretical Computer Science, Proc. 5th GI-Conference, vol.104, pp.152-158, 1981. ,
Conjugacy and episturmian morphisms, Theoret. Comput. Sci, vol.302, pp.1-34, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00598216
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms, Theoret. Comput. Sci, vol.428, pp.92-97, 2012. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00512187
On the conjugation of standard morphisms, Theoret. Comput. Sci, vol.195, pp.91-109, 1998. ,
, The structure of invertible substitutions on a three-letter alphabet, vol.32, pp.736-753, 2004.
Local isomorphisms of invertible substitutions, C.R. Acad. Sci. Paris, Sér. A, vol.318, pp.299-304, 1994. ,
Some remarks on invertible substitutions on three letter alphabet, Chin. Sci. Bulletin, vol.44, pp.1755-1760, 1999. ,