Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
type: Item
instance of: scholarly article
title: Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence
zbMATH Open document ID: 1455.94097
author: Patrick Baxter Dragon
author: Oscar I. Hernandez
author: Joe Sawada
author: Aaron Williams
author: Dennis Wong
published in: European Journal of Combinatorics
publication date: 2018-06-28T00:00:00Z
Mathematics Subject Classification ID: 94A55
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 6896974
zbMATH Keywords: \(k\)-ary de Bruijn sequence
MaRDI profile type: Publication
full work available at URL: j.ejc.2018.03.006
OpenAlex ID: W2799851485
cites work: Generalized de Bruijn words for primitive words and powers
cites work: Lexicographically least circular substrings
cites work: The discrepancy of the lex-least de Bruijn sequence
cites work: The Grandmama de Bruijn Sequence for Binary Strings
cites work: Factorizing words over an ordered alphabet
cites work: Generation of the Ford sequence of length \(2^ n\), n large
cites work: An algorithm for generating necklaces of beads in two colors
cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences
cites work: Q4320535
cites work: A new algorithm for the generation of binary de Bruijn sequences
cites work: Q2957449
cites work: Minimum Eulerian circuits and minimum de Bruijn sequences
cites work: On the theorem of Fredricksen and Maiorana about de Bruijn sequences
cites work: Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences''
cites work: Generating necklaces
cites work: De Bruijn sequences for fixed-weight binary strings
cites work: The lexicographically smallest universal cycle for binary strings with minimum specified weight
cites work: Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
cites work: Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
cites work: A simple shift rule for \(k\)-ary de Bruijn sequences
DOI: 10.1016/J.EJC.2018.03.006
description: scientific article; zbMATH DE number 6896974