[shirshov53]
A. I. Shirshov
Subalgebras of free Lie algebras (Russian)
Mat. Sbornik N. S., (33) 1953, pp. 441--452

[lyndon54]
R. C. Lyndon
On Burnside's Problem
Transactions of the American Mathematical Society, 77(2) 1954, pp. 202--215, doi

[chen58]
K. T. Chen, R. H. Fox, R. C. Lyndon
Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series
Annals of Mathematics, 68(1) 1958, pp. 81--95, doi

[duval83]
J.-P. Duval
Factorizing words over an ordered alphabet
Journal of Algorithms, 4(4) 1983, pp. 363--381, doi

[duval88]
J.-P. Duval
Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée
Theoretical Computer Science, 60(3) 1988, pp. 255--283, doi

[bannai17]
H. Bannai, T. I, S. Inenaga, Y. Nakashima, M. Takeda, K. Tsuruta
The "Runs" Theorem
SIAM Journal on Computing, 46(5) 2017, pp. 1501-1514, doi

[glen17]
A. Glen, J. Simpson, W. F. Smyth
Counting Lyndon Factors
Electronic Journal of Combinatorics, 24(P3.28) 2017, doi

[louza18]
F. A. Louza, W. F. Smyth, G. Manzini
Lyndon Array Construction during Burrows--Wheeler Inversion
Journal of Discrete Algorithms, 50() 2018, pp. 2--9, doi

[daykin18]
J. W. Daykin, F. Franek, J. Holub, A. S. M. Sohidull Islam, W. F. Smyth
Reconstructing a String from its Lyndon Array
Theoretical Computer Science, 710() 2018, pp. 44--51, doi

[franek20]
F. Franek, M. Liut
Computing Maximal Lyndon Substrings of a String
Algorithms, 13(11) 2020, pp. 294, doi