De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science

DOI10.2307/2690079zbMath0492.05014OpenAlexW4206122585WikidataQ56706381 ScholiaQ56706381MaRDI QIDQ3953774

A. Ralston

Publication date: 1982

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2690079

zbMATH Keywords

subsequencesgeneration of de Bruijn sequencessaving memory spaces

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Other designs, configurations (05B30) Eulerian and Hamiltonian graphs (05C45) Algorithms in computer science (68W99)

Related Items (12)

Notes on de Bruijn sequences ⋮ Predecessors of cellular automata states. II: Pre-images of finite sequences ⋮ Extension of de Bruijn graph and Kautz graph ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ On shortening \(u\)-cycles and \(u\)-words for permutations ⋮ Random walks on semaphore codes and delay de Bruijn semigroups ⋮ Necklaces and bracelets in R ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ Wolfram's class IV automata and a good Life ⋮ Maximal state complexity and generalized de Bruijn words

This page was built for publication: De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science