暂无分享,去创建一个
[1] Jean-Pierre Duval,et al. Mots de Lyndon et Périodicité , 1980, RAIRO Theor. Informatics Appl..
[2] M. Lothaire. Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .
[3] R. C. Lyndon. On Burnside’s problem. II , 1955 .
[4] R. Lyndon. On Burnside’s problem , 1954 .
[5] Kazuya Tsuruta,et al. The "Runs" Theorem , 2014, SIAM J. Comput..
[6] Guy Melançon,et al. Lyndon Factorization of Infinite Words , 1996, STACS.
[7] Rani Siromoney,et al. Infinite Lyndon Words , 1994, Inf. Process. Lett..
[8] Josef Kittler,et al. Combinatorial Algorithms , 2016, Lecture Notes in Computer Science.
[9] Jeffrey Shallit,et al. Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences , 2012, LATA.
[10] J. Richard Büchi. Transfinite Automata Recursions and Weak Second Order Theory of Ordinals , 1990 .
[11] Donald E. Knuth,et al. The Art of Computer Programming: Combinatorial Algorithms, Part 1 , 2011 .
[12] Guy Melançon. Viennot Factorization of Infinite Words , 1996, Inf. Process. Lett..
[13] Olivier Carton,et al. Periodicity and roots of transfinite strings , 2001, RAIRO Theor. Informatics Appl..
[14] M. Lothaire,et al. Applied Combinatorics on Words , 2005 .