F. Bassino, J. Clément, and C. Nicaud, Lyndon words with a fixed standard right factor, Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp.646-647, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619866

F. Bassino, J. Clément, and C. Nicaud, The Average Lengths of the Factors of the Standard Factorization of Lyndon Words, DLT'02, pp.307-318, 2003.
DOI : 10.1007/3-540-45005-X_27

URL : https://hal.archives-ouvertes.fr/hal-00619865

J. Berstel and L. Boasson, The set of lyndon words is not context-free, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.63, pp.139-140, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00619462

J. Berstel and D. Perrin, Theory of codes, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

J. Berstel and M. Pocchiola, Average cost of Duval's algorithm for generating Lyndon words, Theoretical Computer Science, vol.132, issue.1-2, pp.1-2, 1994.
DOI : 10.1016/0304-3975(94)00013-1

H. Cartan, Théorié elémentaire des fonctions analytiques d'une ou plusieurs variables complexes, 1985.

K. Chen, R. Fox, and R. Lyndon, Free differential calculus IV: The quotient groups of the lower central series, Ann. Math, vol.58, pp.81-95, 1958.

N. G. De-bruijn, Asymptotic Method in Analysis, 1961.

J. Duval, Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983.
DOI : 10.1016/0196-6774(83)90017-2

W. Feller, An introduction to Probability Theory and Its Applications, 1968.

P. Flajolet, X. Gourdon, and D. Panario, The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields, Journal of Algorithms, vol.40, issue.1, pp.37-81, 2001.
DOI : 10.1006/jagm.2001.1158

URL : https://hal.archives-ouvertes.fr/inria-00073319

P. Flajolet and R. Sedgewick, Analytic combinatorics?symbolic combinatorics, Book in preparation, (Individual chapters are available as INRIA Research reports at http, 2002.

P. Flajolet and M. Soria, The Cycle Construction, SIAM Journal on Discrete Mathematics, vol.4, issue.1, pp.58-60, 1991.
DOI : 10.1137/0404006

H. Fredricksen and J. Maiorana, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math, pp.207-210, 1978.

S. Golomb, Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra, Proc. Conf Combinatorial Math. and Its Appl, pp.358-370, 1969.

G. Hardy and E. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1938.
DOI : 10.1090/S0002-9904-1929-04793-1

D. Knuth, The average time for carry propagation, Indagationes Mathematicae, vol.40, pp.238-242, 1978.

M. Lothaire, of Encyclopedia of mathematics and its applications, Combinatorics on Words, vol.17, 1983.

R. Lyndon, On Burnside problem I, Trans, American Math. Soc, vol.77, pp.202-215, 1954.

R. Marchand and E. Z. Azad, Limit law of the length of the standard right factor of a Lyndon word, arXiv:math

A. M. Odlyzko, Handbook of Combinatorics, 1995.

D. Panario and B. Richmond, Smallest components in decomposable structures: Exp-log class, Algorithmica, vol.14, issue.2, pp.205-226, 2001.
DOI : 10.1007/BF02679619

C. Reutenauer, Free lie algebras, 1993.
DOI : 10.1016/S1570-7954(03)80075-X

F. Ruskey and J. Sawada, Generating Lyndon brackets: a basis for the n-th homogeneous component of the free Lie algebra, Journal of Algorithms, vol.46, pp.21-26, 2003.