V. Canterini and A. Siegel, Geometric representation of substitutions of Pisot type, Trans. Amer. Math. Soc. 353 (2001), 5121-5144.
É. Charlier, J. Leroy, and M. Rigo, Asymptotic properties of free monoid morphisms, Linear Algebra Appl. 500 (2016), 119-148.
C. Choffrut and J. Karhumäki, Combinatorics of words. In Handbook of Formal Languages, Vol. 1, Springer, 1997, pp. 329-438.
F. Durand, A characterization of substitutive sequences using return words, Discrete Math. 179 (1998), 89-101.
F. Durand, B. Host, and C. Skau, Substitutional dynamical systems, Bratteli diagrams and dimension groups, Ergodic Theory Dynam. Systems 19 (1999), 953-993.
A. Ehrenfeucht and G. Rozenberg, Simplifications of homomorphisms, Inform. and Control 38 (1978), 298-309.
N. P. Fogg, Substitutions in Dynamics, Arithmetics and Combinatorics, Lecture Notes in Mathematics, Vol. 1794, Springer-Verlag, 2002.
C. Holton and L. Q. Zamboni, Descendants of primitive substitutions, Theory Comput. Syst. 32 (1999), 133-157.
R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1990.
L. Kari, G. Rozenberg, and A. Salomaa, L systems. In Handbook of Formal Languages, Vol. 1, Springer, 1997, pp. 253-328.
K. Klouda and K. Medková, Synchronizing delay for binary uniform morphisms, Theoret. Comput. Sci. 615 (2016), 12-22.
P. Kůrka, Topological and Symbolic Dynamics, Cours Spécialisés, Vol. 11, Société Mathématique de France, 2003.
F. Mignosi and P. Séébold, If a D0L language is k-power free then it is circular. In Automata, Languages and Programming, Lecture Notes in Comput. Sci., Vol. 700, Springer, 1993, pp. 507-518.
B. Mossé, Puissances de mots et reconnaissabilité des points fixes d’une substitution, Theoret. Comput. Sci. 99 (1992), 327-334.
B. Mossé, Reconnaissabilité des substitutions et complexité des suites automatiques, Bull. Soc. Math. France 124 (1996), 329-346.
M. Queffélec, Substitution Dynamical Systems-Spectral Analysis, Lecture Notes in Mathematics, Vol. 1294, Springer-Verlag, 2nd edition, 2010.
