The grandmama de Bruijn sequence for binary strings

DOI10.1007/978-3-662-49529-2_26MaRDI QIDQ2802952zbMATH OpenOpenAlexFDO

Authors Patrick Baxter Dragon, Aaron Williams

Publication date 3 May 2016

Published in LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_26

zbMATH Keywords

de Bruijn sequenceFKM constructionFord sequencelexicographic orderLyndon wordnecklace

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• A surprisingly simple de Bruijn sequence construction
• A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
• De Bruijn sequences for fixed-weight binary strings
• Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions

Cited in

(6)

• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
• Constructing de Bruijn sequences by concatenating smaller universal cycles
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
• A framework for constructing de Bruijn sequences via simple successor rules
• Investigating the discrepancy property of de Bruijn sequences
• An efficient generalized shift-rule for the prefer-max de Bruijn sequence

This page was built for publication: The grandmama de Bruijn sequence for binary strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802952)