Binary De Bruijn Partial Words with One Hole
From MaRDI portal
Publication:3569070
DOI10.1007/978-3-642-13562-0_13zbMath1284.68482MaRDI QIDQ3569070
Slater Stich, Jarett Schwartz, Francine Blanchet-Sadri, B. J. Wyatt
Publication date: 17 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_13
combinatorial problems; de Bruijn sequences; subword complexity; combinatorics on words; de Bruijn graphs; partial words; Eulerian paths
68R15: Combinatorics on words
Related Items
Graph universal cycles: compression and connections to universal cycles, Constructing partial words with subword complexities not achievable by full words, On minimal Sturmian partial words