On extending de Bruijn sequences

DOI10.1016/j.ipl.2011.06.013zbMath1260.68311OpenAlexW2141215384WikidataQ61927025 ScholiaQ61927025MaRDI QIDQ1944170

Verónica Becher, Pablo Ariel Heiber

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.013

zbMATH Keywords

combinatorial problemsgraph algorithmsde Bruijn sequencesword problems

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Initial non-repetitive complexity of infinite words ⋮ Perfect necklaces ⋮ Uniformly de Bruijn sequences and symbolic Diophantine approximation on fractals ⋮ Extending de Bruijn sequences to larger alphabets ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ On semi-perfect de Bruijn words ⋮ A linearly computable measure of string complexity ⋮ Normal Numbers and Computer Science ⋮ A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers ⋮ Some negative results related to Poissonian pair correlation problems ⋮ Low discrepancy sequences failing Poissonian pair correlations ⋮ A construction of a 𝜆-Poisson generic sequence

Cites Work

• The origins of combinatorics on words
• The discrepancy of the lex-least de Bruijn sequence
• Strings with maximally many distinct subsequences and substrings
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Regular Sequences and Frequency Distributions
• Normal Recurring Decimals

This page was built for publication: On extending de Bruijn sequences