The Grandmama de Bruijn Sequence for Binary Strings

DOI10.1007/978-3-662-49529-2_26zbMath1475.68257OpenAlexW2489207806MaRDI QIDQ2802952

Oscar I. Hernandez, 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

lexicographic orderde Bruijn sequenceFord sequenceLyndon wordnecklaceFKM construction

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (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 ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Investigating the discrepancy property of de Bruijn sequences

This page was built for publication: The Grandmama de Bruijn Sequence for Binary Strings