Abstract
Fredricksen and Maiorana (1978) [2] 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) [4]. 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.
Original language | English |
---|---|
Pages (from-to) | 184-187 |
Number of pages | 4 |
Journal | Advances in Applied Mathematics |
Volume | 62 |
DOIs |
|
State | Published - 1 Jan 2015 |
Keywords
- De Bruijn sequence
- Lyndon words
- Necklaces