A Lyndon word is a nonempty finite word over an alphabet with a total order that is strictly smaller in lexicographic order than each of its nontrivial cyclic rotations. Equivalently, it is the least representative of an aperiodic necklace (Ruskey).
Lyndon Word
See also
de Bruijn Sequence, Irreducible Polynomial, NecklaceExplore with Wolfram|Alpha
References
Ruskey, F. "Information on Necklaces, Lyndon Words, de Bruijn Sequences." https://oeis.org/A000011/a000011.pdf.Sloane, N. J. A. Sequence A001037/M0116 in "The On-Line Encyclopedia of Integer Sequences."Referenced on Wolfram|Alpha
Lyndon WordCite this as:
Weisstein, Eric W. "Lyndon Word." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/LyndonWord.html