暂无分享,去创建一个
[1] Antal Iványi. On the d-complexity of words , 1987 .
[2] Alina Firicel. Quelques contributions à l'étude des séries formelles à coefficients dans un corps fini , 2010 .
[3] Fabien Durand,et al. Cobham's theorem for substitutions , 2010, ArXiv.
[4] Jean-Paul Allouche,et al. Sur la transcendance de la série formelle Π , 1990 .
[5] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[6] Derick Wood,et al. Pm Numbers, Ambiguity, and Regularity , 1993, RAIRO Theor. Informatics Appl..
[7] Abraham D. Flaxman,et al. Strings with Maximally Many Distinct Subsequences and Substrings , 2004, Electron. J. Comb..
[8] Alina Firicel,et al. # A 7 INTEGERS 11 B ( 2011 ) SUBWORD COMPLEXITY AND LAURENT SERIES , 2011 .
[9] Jeffrey Shallit,et al. Sur Des Points Fixes De Morphismes D'Un Monoïde Libre , 1989, RAIRO Theor. Informatics Appl..
[10] Jeffrey Shallit,et al. On the maximum number of distinct factors of a binary string , 1993, Graphs Comb..