compile = truefalse

True means compile the iterator. The default is true.

rank = nonnegint

Specify the starting rank of the iterator. The default is one. Passing a value greater than one causes the iterator to skip the lower ranks; this can be useful when parallelizing iterators. The starting rank reverts to one when the iterator is reset, reused, or copied.

atmost = truefalse

True means words with length less than or equal to n are returned, false means the returned words have length n. When atmost is true, the rank option and the Rank and Unrank methods cannot be used. The default is true.  The `<=` symbol is a synonym for this keyword.

The LyndonWord command returns an iterator that generates m-ary Lyndon words in lexicographic order. The alphabet consists of the integers from 0 to $m-1$.

The n parameter is the maximum length of the Lyndon word.

The m parameter is the length of the alphabet, which consists of the integers from 0 to $m-1$.

A Lyndon word is an aperiodic necklace. A necklace is an equivalence class of strings under rotation. The representative of a class is the smallest string, lexicographically, in the class.

$\mathrm{with}\left(\mathrm{Iterator}\right)\&colon;$

$P≔\mathrm{LyndonWord}\left(4\&comma;3\right)\&colon;$

$\mathrm{Print}\left(P\&comma;'\mathrm{showrank}'\right)\&colon;$

 1: 0 0 0 1
 2: 0 0 0 2
 3: 0 0 1 1
 4: 0 0 1 2
 5: 0 0 2 1
 6: 0 0 2 2
 7: 0 1 0 2
 8: 0 1 1 1
 9: 0 1 1 2
10: 0 1 2 1
11: 0 1 2 2
12: 0 2 1 1
13: 0 2 1 2
14: 0 2 2 1
15: 0 2 2 2
16: 1 1 1 2
17: 1 1 2 2
18: 1 2 2 2

$\mathrm{Number}\left(P\right)$

$18$

$\mathrm{Rank}\left(P\&comma;\left[0\&comma;1\&comma;1\&comma;2\right]\right)$

$9$

$\mathrm{Unrank}\left(P\&comma;5\right)$

$\left[\begin{array}{cccc}0& 0& 2& 1\end{array}\right]$

$\mathrm{Patmost}≔\mathrm{Object}\left(P\&comma;'\mathrm{atmost}'\right)\&colon;$

$\mathrm{Print}\left(\mathrm{Patmost}\&comma;'\mathrm{showrank}'\right)$

 1: 0
 2: 0 0 0 1
 3: 0 0 0 2
 4: 0 0 1
 5: 0 0 1 1
 6: 0 0 1 2
 7: 0 0 2
 8: 0 0 2 1
 9: 0 0 2 2
10: 0 1
11: 0 1 0 2
12: 0 1 1
13: 0 1 1 1
14: 0 1 1 2
15: 0 1 2
16: 0 1 2 1
17: 0 1 2 2
18: 0 2
19: 0 2 1
20: 0 2 1 1
21: 0 2 1 2
22: 0 2 2
23: 0 2 2 1
24: 0 2 2 2
25: 1
26: 1 1 1 2
27: 1 1 2
28: 1 1 2 2
29: 1 2
30: 1 2 2
31: 1 2 2 2
32: 2

Knuth, Donald Ervin. The Art of Computer Programming, volume 4, fascicle 2; generating all tuples and permutations, sec. 7.2.1.1, generating all n-tuples, pp. 26-27.

ibid, Algorithm F, prime and preprime string generation, p. 27.

Practical Algorithms to Rank Necklaces, Lyndon Words, and de Bruijn Sequences, Joe Sawada and Aaron Williams, Journal of Discrete Algorithms, vol. 43, March 2017, pp. 95-110.

The Iterator[LyndonWord] command was introduced in Maple 2020.

For more information on Maple 2020 changes, see Updates in Maple 2020.

The Iterator[LyndonWord] command was updated in Maple 2022.

The n and m parameters were updated in Maple 2022.

The atmost option was introduced in Maple 2022.

For more information on Maple 2022 changes, see Updates in Maple 2022.