de Bruijn sequences and de Bruijn graphs for a general language

DOI10.1016/j.ipl.2005.05.028zbMath1184.68323OpenAlexW2031029163WikidataQ57707491 ScholiaQ57707491MaRDI QIDQ1044740

Eduardo Moreno

Publication date: 18 December 2009

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

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

zbMATH Keywords

combinatorial problemsgraph algorithmsde Bruijn sequencescombinatorics on wordsde Bruijn graphsEulerian labeled graphs

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Designing preference functions for de Bruijn sequences with forbidden words ⋮ Binary bubble languages and cool-lex order ⋮ A note on certain de Bruijn sequences with forbidden subsequences ⋮ Generalized de Bruijn words for primitive words and powers ⋮ Spectral continuity for aperiodic quantum systems: Applications of a folklore theorem ⋮ Eulerian entropy and non-repetitive subword complexity ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ Minimum Eulerian circuits and minimum de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal cycles for combinatorial structures
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Complexity and special factors
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Generating necklaces
• De Bruijn and Kautz bus networks
• An Introduction to Symbolic Dynamics and Coding
• Normal Recurring Decimals