Duval, Jean Pierre Factorizing words over an ordered alphabet. (English) Zbl 0532.68061 J. Algorithms 4, 363-381 (1983). Summary: An efficient algorithm to obtain a factorization of words over an ordered alphabet known as Lyndon factorization is presented. Applications of this algorithm are given to the computation of the least suffix of a word and the least circular shift of a word. Cited in 6 ReviewsCited in 85 Documents MSC: 68P10 Searching and sorting Keywords:sorting; algorithm; Lyndon factorization; least suffix; least circular shift PDF BibTeX XML Cite \textit{J. P. Duval}, J. Algorithms 4, 363--381 (1983; Zbl 0532.68061) Full Text: DOI OpenURL