暂无分享,去创建一个
[1] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[2] Michel Rigo,et al. About frequencies of letters in generalized automatic sequences , 2007, Theor. Comput. Sci..
[3] Fabien Durand,et al. A Generalization of Cobham's Theorem , 1998, Theory of Computing Systems.
[4] C Mauduit,et al. Unispectral morphisms , 1986 .
[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[6] B. Lindqvist. Asymptotic properties of powers of nonnegative matrices, with applications , 1989 .
[7] F. R. Gantmakher. The Theory of Matrices , 1984 .
[8] Alfred J. van der Poorten,et al. Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..
[9] Christian Mauduit. Morphismes Unispectraux , 1986, Theor. Comput. Sci..
[10] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[11] B. Lindqvist. ASYMPTOTIC PROPERTIES OF POWERS OF NON-NEGATIVE MATRICES , 1978 .
[12] Michel Rigo. Generalization of automatic sequences for numeration systems on a regular language , 2000, Theor. Comput. Sci..
[13] François Nicolas,et al. Asymptotic behavior of growth functions of D0L-systems , 2008, ArXiv.
[14] Juha Honkala. On the simplification of infinite morphic words , 2009, Theor. Comput. Sci..
[15] Michel Rigo,et al. More on Generalized Automatic Sequences , 2002, J. Autom. Lang. Comb..
[16] Peter Lancaster,et al. The theory of matrices , 1969 .
[17] E. Seneta. Non-negative Matrices and Markov Chains , 2008 .
[18] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[19] Peter C. Chapin. Formal languages I , 1973, CSC '73.
[20] Lawrence S. Moss,et al. Eigenvalues and Transduction of Morphic Sequences: Extended Version , 2014, ArXiv.
[21] Alan Cobham,et al. On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.
[22] Alan Cobham,et al. On the Hartmanis-Stearns Problem for a Class of TAG Machines , 1968, SWAT.
[23] Alan Cobham,et al. Uniform tag sequences , 1972, Mathematical systems theory.
[24] Fabien Durand,et al. Decidability of the HD0L ultimate periodicity problem , 2011, RAIRO Theor. Informatics Appl..
[25] Fabien Durand,et al. A theorem of Cobham for non-primitive substitutions , 2008, ArXiv.
[26] François Nicolas,et al. Quelques propriétés des mots substitutifs , 2003 .
[27] Jean-Jacques Pansiot. Hiérarchie et fermeture de certaines classes de tag-systèmes , 2004, Acta Informatica.
[28] C. Michaux,et al. LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .
[29] Mark C. Wilson,et al. Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions , 2005, SIAM Rev..
[30] Dominique Foata,et al. Eulerian Polynomials: From Euler’s Time to the Present , 2010 .
[31] Narad Rampersad,et al. The growth function of S-recognizable sets , 2011, Theor. Comput. Sci..
[32] Fabien Durand,et al. Cobham's theorem for substitutions , 2010, ArXiv.
[33] Tero Harju,et al. Combinatorics on Words , 2004 .
[34] M. Rigo. Formal Languages, Automata and Numeration Systems 1: Introduction to Combinatorics on Words , 2014 .
[35] Michel Rigo,et al. Syndeticity and independent substitutions , 2009, Adv. Appl. Math..
[36] F. Michel Dekking,et al. Iteration of maps by an automaton , 1994, Discret. Math..
[37] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[38] J. A. Salvato. John wiley & sons. , 1994, Environmental science & technology.
[39] F. Durand,et al. Sur les ensembles d'entiers reconnaissables , 2008, 0801.0556.