Fredricksen and Maiorana (1978)  prove that the concatenation of Lyndon words of length dividing n in lexicographic order produces a de Bruijn sequence of span n, and they state that this word is lexicographically minimal among all de Bruijn sequences of span n. An alternative proof was presented in Moreno (2004) . The purpose of this corrigendum is twofold. We give a complete proof, clarifying some ambiguities of the previous proof. Additionally, we include a proof of the minimality of the de Bruijn sequence obtained in this way.
|Number of pages||4|
|Journal||Advances in Applied Mathematics|
|State||Published - 1 Jan 2015|
- De Bruijn sequence
- Lyndon words