StringTools[LyndonFactors] - compute the Lyndon factorization of a string
|
Calling Sequence
|
|
LyndonFactors( w )
|
|
Description
|
|
•
|
The LyndonFactors(w) command produces the Lyndon factorization of the string w.
|
•
|
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.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?