On the theorem of Fredricksen and Maiorana about de Bruijn sequences

DOI10.1016/j.aam.2003.10.002zbMath1050.05008OpenAlexW2015696676WikidataQ57707495 ScholiaQ57707495MaRDI QIDQ1883388

Eduardo Moreno

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2003.10.002

zbMATH Keywords

Lyndon wordsde Bruijn sequencenecklaces

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (5)

Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence ⋮ Generalized Fibonacci recurrences and the lex-least de Bruijn sequence ⋮ Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences ⋮ Burrows-Wheeler transformations and de Bruijn words

Cites Work

• Necklaces of beads in k colors and k-ary de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms

This page was built for publication: On the theorem of Fredricksen and Maiorana about de Bruijn sequences