de Bruijn sequences and de Bruijn graphs for a general language
DOI10.1016/J.IPL.2005.05.028zbMATH Open1184.68323OpenAlexW2031029163WikidataQ57707491 ScholiaQ57707491MaRDI QIDQ1044740FDOQ1044740
Authors: 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
Recommendations
combinatorics on wordsgraph algorithmsde Bruijn sequencescombinatorial problemsde Bruijn graphsEulerian labeled graphs
Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- An Introduction to Symbolic Dynamics and Coding
- Title not available (Why is that?)
- Normal Recurring Decimals
- Universal cycles for combinatorial structures
- Complexity and special factors
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Generating necklaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- De Bruijn and Kautz bus networks
Cited In (20)
- Title not available (Why is that?)
- A toolkit for graphical analysis of word chains
- A note on certain de Bruijn sequences with forbidden subsequences
- Binary bubble languages and cool-lex order
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
- De Bruijn sequences revisited
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Title not available (Why is that?)
- Eulerian entropy and non-repetitive subword complexity
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences
- Designing preference functions for de Bruijn sequences with forbidden words
- Spectral continuity for aperiodic quantum systems: applications of a folklore theorem
- On a family of universal cycles for multi-dimensional permutations
- Generalized de Bruijn words for primitive words and powers
- Graph-Theoretic Concepts in Computer Science
- Computing generalized de Bruijn sequences
- An unoriented variation on de Bruijn sequences
- De Bruijn sequences with varying combs
- Extending de Bruijn sequences to larger alphabets
- On semi-perfect de Bruijn words
This page was built for publication: de Bruijn sequences and de Bruijn graphs for a general language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044740)
