de Bruijn sequences and de Bruijn graphs for a general language

DOI10.1016/j.ipl.2005.05.028zbMath1184.68323WikidataQ57707491 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 problems; graph algorithms; de Bruijn sequences; combinatorics on words; de Bruijn graphs; Eulerian labeled graphs

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

68Q45: Formal languages and automata

68R10: Graph theory (including graph drawing) in computer science

Related Items

Binary bubble languages and cool-lex order, Eulerian entropy and non-repetitive subword complexity, A note on certain de Bruijn sequences with forbidden subsequences, Minimum Eulerian circuits and minimum de Bruijn sequences, Generalized de Bruijn words for primitive words and powers

Cites Work

• Unnamed Item
• 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
• An Introduction to Symbolic Dynamics and Coding
• Normal Recurring Decimals