J.-P. Allouche Automates finis en théorie des nombres Expo. Math. 5 3 1987 239 266
J.-P. Allouche, and J. Shallit Automatic Sequences, Theory, Applications, Generalizations 2003 Cambridge University Press Cambridge
V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire Logic and p-recognizable sets of integers Bull. Belg. Math. Soc. 1 1994 191 238
V. Berthé, and M. Rigo Combinatorics, Automata, and Number Theory Encyclopedia of Mathematics and Its Applications vol. 135 2010 Cambridge University Press
C. Choffrut, and J. Karhumäki Combinatorics of words G. Rozenberg, A. Salomaa, Handbook of Formal Languages, vol. 1 1997 Springer-Verlag 329 438
J. Cassaigne, C. Mauduit, and F. Nicolas Asymptotic behavior of growth functions of d0l-systems arXiv:0804.1327 [cs.DM] 2008
J. Cassaigne, and F. Nicolas Quelques propriétés des mots substitutifs Bull. Belg. Math. Soc. Simon Stevin 10 suppl. 2003 661 676
A. Cobham On the Hartmanis-Stearns problem for a class of tag machines Switching and Automata Theory, Ninth Annual Symposium on Switching and Automata Theory 1968 51 60
A. Cobham On the base-dependence of sets of numbers recognizable by finite automata Math. Syst. Theory 1969 186 192
A. Cobham Uniform tag sequences Math. Syst. Theory 6 1972 164 192
É. Charlier, and N. Rampersad The growth function of S-recognizable sets Theoret. Comput. Sci. 412 39 2011 5400 5408
F.M. Dekking Iteration of maps by an automaton Discrete Math. 126 1-3 1994 81 86
F. Durand, and M. Rigo Syndeticity and independent substitutions Adv. in Appl. Math. 42 1 2009 1 22
F. Durand A generalization of Cobham's theorem Theory Comput. Syst. 31 1998 169 185
F. Durand Sur les ensembles d'entiers reconnaissables J. Théor. Nombres Bordeaux 10 1998 65 84
F. Durand A theorem of Cobham for non-primitive substitutions Acta Arith. 104 3 2002 225 241
F. Durand Cobham's theorem for substitutions J. Eur. Math. Soc. (JEMS) 13 6 2011 1799 1814
F. Durand Decidability of the HD0L ultimate periodicity problem RAIRO Theor. Inform. Appl. 47 2 2013 201 214
William Feller An Introduction to Probability Theory and Its Applications, vol. I 1950 John Wiley & Sons, Inc. New York, NY
D. Foata Eulerian polynomials: from Euler's time to the present The Legacy of Alladi Ramakrishnan in the Mathematical Sciences 2010 Springer New York 253 273
F.R. Gantmacher The Theory of Matrices, vol. 2 1959 Chelsea Publishing Co. New York
R.A. Horn, and C.R. Johnson Matrix Analysis second ed. 2013 Cambridge University Press Cambridge
J. Honkala On the simplification of infinite morphic words Theoret. Comput. Sci. 410 8-10 2009 997 1000
B.H. Lindqvist Asymptotic properties of powers of nonnegative matrices, with applications Linear Algebra Appl. 114/115 1989 555 588
D. Lind, and B. Marcus An Introduction to Symbolic Dynamics and Coding 1995 Cambridge University Press Cambridge
C. Meyer Matrix Analysis and Applied Linear Algebra 2000 Society for Industrial and Applied Mathematics (SIAM) Philadelphia, PA
S. Nicolay, and M. Rigo About frequencies of letters in generalized automatic sequences Theoret. Comput. Sci. 374 1-3 2007 25 40
J.-J. Pansiot Hiérarchie et fermeture de certaines classes de tag-systèmes Acta Inform. 20 2 1983 179 196
R. Pemantle, and M.C. Wilson Twenty combinatorial examples of asymptotics derived from multivariate generating functions SIAM Rev. 50 2 2008 199 272
M. Rigo Generalization of automatic sequences for numeration systems on a regular language Theoret. Comput. Sci. 244 1-2 2000 271 281
M. Rigo Formal Languages, Automata and Numeration Systems: Introduction to Combinatorics on Words Network and Telecommunications Series vol. 1 2014 ISTE-Wiley
M. Rigo, and A. Maes More on generalized automatic sequences J. Autom. Lang. Comb. 7 3 2002 351 376
E. Seneta Nonnegative Matrices and Markov Chains second ed. 1981 Springer-Verlag New York
A. Salomaa, and M. Soittola Automata-Theoretic Aspects of Formal Power Series Texts and Monographs in Computer Science 1978 Springer-Verlag New York, Heidelberg
D. Sprunger, W. Tune, J. Endrullis, and L.S. Moss Eigenvalues and transduction of morphic sequences: extended version arXiv:1406.1754 2014