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 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

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.

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

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.

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.