|
•
|
A word (string) w is a Lyndon word if it is aperiodic and is the lexicographically least member of its conjugacy class (which is the set of all rotations of w). Every word admits an unique factorization as a product (catenation) of a non-increasing sequence of Lyndon words, called its Lyndon factorization.
|
