A Simple Combinatorial Algorithm for de Bruijn Sequences

DOI10.4169/000298910X515794zbMath1232.05006OpenAlexW2294002006WikidataQ58120893 ScholiaQ58120893MaRDI QIDQ3057811

Abbas Alhakim

Publication date: 17 November 2010

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: http://www.maa.org/pubs/monthly_oct10_toc.html

zbMATH Keywords

prefer-one algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Nonstandard Analysis of the Behavior of Ergodic Means of Dynamical Systems on Very Big Finite Probability Spaces ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ Mapping prefer-opposite to prefer-one de Bruijn sequences ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ A relation between sequences generated by Golomb's preference algorithm ⋮ Cover times for Markov-generated binary sequences of length two ⋮ Spans of preference functions for de Bruijn sequences ⋮ Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions ⋮ A surprisingly simple de Bruijn sequence construction ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ Generalized de Bruijn words for primitive words and powers ⋮ Investigating the discrepancy property of de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences

This page was built for publication: A Simple Combinatorial Algorithm for de Bruijn Sequences