@article{duval83,
title = {Factorizing words over an ordered alphabet},
journal = {Journal of Algorithms},
volume = {4},
number = {4},
pages = {363--381},
year = {1983},
issn = {0196-6774},
doi = {https://doi.org/10.1016/0196-6774(83)90017-2},
url = {https://www.sciencedirect.com/science/article/pii/0196677483900172},
author = {J.-P. Duval},
abstract = {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.}
}