Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles

Electronic Journal Of Combinatorics

Joe Sawada¹ 

关键词: k-suffix language;    de Bruijn sequence;    Universal cycle;    Greedy algorithm;    FKM algorithm;    Necklaces;    Lexicographical ordering;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We present a class of languages that have an interesting property: For each language $\mathbf{L}$ in the class, both the classic greedy algorithm and the classic Lyndon word (or necklace) concatenation algorithm provide the lexicographically smallest univ

【 授权许可】

Others