Generalized de Bruijn words for primitive words and powers

DOI10.1016/j.disc.2015.05.025zbMath1328.68153arXiv0904.3997OpenAlexW2963757710MaRDI QIDQ2515571

Yu Hin (Gary) Au

Publication date: 5 August 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.3997

zbMATH Keywords

Lyndon wordsde Bruijn graphsprimitive wordsde Bruijn words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

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 ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ String rearrangement inequalities and a total order between primitive words ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence

Cites Work

• Unnamed Item
• Unnamed Item
• de Bruijn sequences and de Bruijn graphs for a general language
• Universal cycles for permutations
• Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
• Universal cycles for combinatorial structures
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating necklaces

This page was built for publication: Generalized de Bruijn words for primitive words and powers