D M ] 2 A ug 2 01 4 The finite index basis property
暂无分享,去创建一个
C. Reutenauer | C. D. Felice | D. Perrin | V. Berthé | F. Dolce | J. Leroy | G. Rindone
[1] Christophe Reutenauer,et al. Acyclic, connected and tree sets , 2015 .
[2] Dominique Perrin,et al. Bifix codes and interval exchanges , 2014, 1408.0389.
[3] Valérie Berthé. Combinatorics , Automata and Number Theory , 2011 .
[4] Jean Berstel,et al. Bifix codes and Sturmian words , 2010, ArXiv.
[5] Dominique Perrin,et al. Codes and Automata , 2009, Encyclopedia of mathematics and its applications.
[6] Jacques Justin,et al. Episturmian words: a survey , 2008, RAIRO Theor. Informatics Appl..
[7] Jeffrey Shallit,et al. Automatic Sequences: Theory, Applications, Generalizations , 2003 .
[8] M. Lothaire. Algebraic Combinatorics on Words , 2002 .
[9] C. Mauduit,et al. Substitutions in dynamics, arithmetics, and combinatorics , 2002 .
[10] Laurent Vuillon,et al. Return words in Sturmian and episturmian words , 2000, RAIRO Theor. Informatics Appl..
[11] Julien Cassaigne,et al. Complexité et facteurs spéciaux , 1997 .
[12] Gérard Rauzy,et al. Représentation géométrique de suites de complexité $2n+1$ , 1991 .