Computing generalized de Bruijn sequences

DOI10.1016/j.tcs.2017.09.010zbMath1390.68511OpenAlexW2755302573MaRDI QIDQ1680534

Sinziana Munteanu, Francine Blanchet-Sadri

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.010

zbMATH Keywords

graph theorycombinatorics on wordsalgorithms on wordspartial wordssubwordsrepresentable sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• The coolest way to generate binary strings
• On the de Bruijn torus problem
• The origins of combinatorics on words
• Universal cycles for combinatorial structures
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• On universal partial words
• Shorthand universal cycles for permutations
• De Bruijn sequences with efficient decoding algorithms
• Deciding representability of sets of words of equal length
• Computing minimum length representations of sets of words of uniform length
• m-ary closed sequences
• Sets Represented as the Length-n Factors of a Word
• Deciding Representability of Sets of Words of Equal Length in Polynomial Time
• Binary Ring Sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On Pseudo-Random Arrays
• Handbook of Graph Theory
• A problem in arrangements
• An Introduction to Symbolic Dynamics and Coding
• Algorithmic Combinatorics on Partial Words
• Depth-First Search and Linear Graph Algorithms