On generalized Lyndon words (Q2422029)

A generalized lexicographical order is defined so that the order between two words depends on the length of their common prefix and is defined by the chosen total order between letters in a given position. For example, in the alternating lexicographic order, \(a<b\) at odd positions and \(b<a\) at even positions. Generalized Lyndon words are defined with respect to a given generalized lexicographic order as follows: a finite word \(w\) is a generalized Lyndon word if for every factorisation \(w=uv\) we have \(w^{\omega}<(vu)^{\omega}\). Such words were defined in 2005 by the third author of the paper (see [\textit{C. Reutenauer}, Sémin. Lothar. Comb. 54, B54h, 16 p. (2005; Zbl 1183.68445)]). This paper contains shorter proofs of the results of the previous paper, some new characterisations of generalized Lyndon words and particular results on classical Lyndon words and on the alternating order.