1. F. Bassino, J. Clément, C. Nicaud, The average lengths of the factors of the standard factorization of Lyndon words, in: DLT’02, Lecture Notes in Computer Science, vol. 2450, Springer, Berlin, 2003, pp. 307–318.
2. F. Bassino, J. Clément, C. Nicaud, Lyndon words with a fixed standard right factor, in: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’04), ACM-SIAM, 2004, pp. 646–647.
3. The set of Lyndon words is not context-free;Berstel;Bull. Europ. Assoc. Theoret. Comput. Sci. EATCS,1997
4. Theory of Codes;Berstel,1985
5. Average cost of Duval's algorithm for generating Lyndon words;Berstel;Theoret. Comput. Sci.,1994