N. Aubrun and M.-P. Beal, Tree-shifts of finite type, Theoret. Comput. Sci. 459 (2012) 16-25.
J. Berstel, C. De Felice, D. Perrin, C. Reutenauer and G. Rindone, Bi-x codes and Sturmian words, J. Algebra 369 (2012) 146-202.
V. Berthe and V. Delecroix, Beyond substitutive dynamical systems: S-adic expansions, RIMS Lecture note Kokyuroku Bessatu' B46 (2014) 81-123.
V. Berthe, D. Frettlöh and V. Sirvent, Selfdual substitutions in dimension one, Euro-pean J. of Combinatorics 33 (2012) 981-1000.
V. Berthe, C. Holton and L. Q. Zamboni, Initial powers of Sturmian sequences, Acta Arith. 122 (2006) 315-347.
V. Berthe, H. Ei, S. Ito and H. Rao, On substitution invariant Sturmian words: An application of Rauzy fractals, Theoret. Informatics Appl. 41 (2007) 329-349.
V. Berthe, C. De Felice, F. Dolce, J. Leroy, D. Perrin, C. Reutenauer and G. Rindone, Acyclic, connected and tree sets, Monatsh. Math. 176 (2015) 521-550.
V. Berthe, C. De Felice, F. Dolce, J. Leroy, D. Perrin, C. Reutenauer and G. Rindone, Maximal bi-x decoding, Discrete Math. 338 (2015) 725-742.
V. Berthe, C. De Felice, F. Dolce, J. Leroy, D. Perrin, C. Reutenauer and G. Rindone, The finite index basis property, J. Pure Appl. Algebra 219 (2015) 2521-2537.
J. Cassaigne, S. Ferenczi and A. Messaoudi, Weak mixing and eigenvalues for Arnoux-Rauzy sequences, Ann. Inst. Fourier (Grenoble) 58 (2008) 1983-2005.
F. M. Dekking, The spectrum of dynamical systems arising from substitutions of constant length, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 41 (1977/78) 221-239.
V. Diekert and D. Krieger, Some remarks about stabilizers, Theoret. Comput. Sci. 410 (2009) 2935-2946.
F. Dolce, R. Kyriakoglou and J. Leroy, Decidable properties of extension graphs for substitutive languages, (16th Mons Theoretical Computer Science Days, Lifiege, Belgium).
F. Dolce and D. Perrin, Neutral and tree sets of arbitrary characteristic, Theoretical Computer Science 658 (2017) 159-174.
T. Downarowicz, Survey of odometers and Toeplitz ows, Algebraic and Topological Dynamics, Contemp. Math. 385 (2005) 7-37.
F. Durand, A characterization of substitutive sequences using return words, Dicrete Math. 179 (1998) 89-101.
F. Durand, Linearly recurrent subshifts have a finite number of non-periodic subshift factors, Ergodic Theory & Dynam. Systems 20 (2000) 1061-1078; Corrigendum and addendum, Ergodic Theory & Dynam. Systems 23 (2003) 663-669.
F. Durand, Cobham's theorem for substitutions, J. Eur. Math. Soc. (JEMS) 13 (2011) 1799-1814.
F. Durand, HD0L !-equivalence and periodicity problems in the primitive case, Unif. Distrib. Theory 7 (2012) 199-215.
F. Durand and M. Rigo, Syndeticity and independent substitutions, Adv. Appl. Math. 42 (2009) 1-22.
F. Durand, J. Leroy and G. Richomme, Do the properties of an S-adic representation determine factor complexity, J. of Integer Sequences 16 (2013), Article 13-2-6.
Fogg, N. Pytheas, Substitutions in Dynamics, Arithmetics and Combinatorics (Springer-Verlag, Berlin, 2002).
H. Hmili, Non topologically weakly mixing interval exchanges, Discrete Contin. Dyn. Syst. 27 (2010) 1079-1091.
B. Host, Valeurs propres des systemes dynamiques dfiefinis par des substitutions de longueur variable, Ergodic Theory Dynam. Systems 6 (1986) 529-540.
D. Krieger, On stabilizers of infinite words, Theoret. Comput. Sci. 400 (2008) 169-181.
J. Leroy, Some improvements of the S-adic conjecture, Adv. in Appl. Math. 48 (2012) 79-98.
J. Leroy, An S-adic characterization of minimal subshifts with first difierence of complexity 1 - p(n + 1) p(n) - 2, Discrete Math. Theor. Comput. Sci. 16 (2014) 233-286.
J. Leroy and G. Richomme, A combinatorial proof of S-adicity for sequences with linear complexity, Integers 13 (2013), Paper No. A5.
M. Lothaire, Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications, Vol. 90 (Cambridge University Press, Cambridge, United Kingdom, 2002).
W. Magnus, A. Karrass and D. Solitar, Combinatorial Group Theory (Dover Publications, Inc., Mineola, NY, 2004), Second Edition.
F. Mignosi and P. S Efiebold, Morphismes sturmiens et regles de Rauzy, J. Theor. Nombres Bordeaux 5 (1993) 221-233.
B. MosS E, Puissances de mots et reconnaissabilite des points -xes d'une substitution, Theoret. Comput. Sci. 99 (1992) 327-334.
B. MosS E, Reconnaissabilite des substitutions et complexite des suites automatiques, Bull. Soc. Math. France 124 (1996) 329-346.
N. Ormes, Strong orbit realization for minimal homeomorphisms, J. Anal. Math. 71 (1997) 103-133.
J. J. Pansiot, A decidable property of iterated morphisms, in Deussen P. (eds) Theoretical Computer Science, Proc. 5th GI-Conference, Lecture Notes in Computer Science 104 (1981) 152-158.
G. Richomme, Conjugacy and episturmian morphisms, Theoret. Comput. Sci. 302 (2003) 1-34.
G. Richomme and P. S Efiebold, Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms, Theoret. Comput. Sci. 428 (2012) 92-97.
P. S Efiebold, On the conjugation of standard morphisms, Theoret. Comput. Sci. 195 (1998) 91-109.
B. Tan, Z.-X. Wen and Y. Zhang, The structure of invertible substitutions on a three-letter alphabet, Adv. in Appl. Math. 32 (2004) 736-753.
Z.-X. Wen and Z.-Y. Wen, Local isomorphisms of invertible substitutions, C. R. Acad. Sci. Paris, S Er. A 318 (1994) 299-304.
Z.-X. Wen and Y. Zhang, Some remarks on invertible substitutions on three letter alphabet, Chin. Sci. Bulletin 44 (1999) 1755-1760.
