Standard Factorization of a Word (String) |
|
A Lyndon word is a word that is
lexicographically (alphabetically) strictly smaller than all of its
non-trivial cyclic rotations.
An arbitrary word, w, can be uniquely factorized,
|
|
↑ © L. Allison, www.allisons.org/ll/ (or as otherwise indicated). Created with "vi (Linux)", charset=iso-8859-1, fetched Friday, 26-Apr-2024 23:24:59 UTC. Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off. |