On semi-perfect de Bruijn words

DOI10.1016/J.TCS.2018.02.008zbMath1388.68245OpenAlexW2790290836MaRDI QIDQ1704583

Damian Repke, Wojciech Rytter

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.008

zbMATH Keywords

algorithmstraight-line programde Bruijn wordsemi-perfect word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (1)

Extending de Bruijn sequences to larger alphabets

Cites Work

• On extending de Bruijn sequences
• On the maximum number of distinct factors of a binary string
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Unnamed Item

This page was built for publication: On semi-perfect de Bruijn words