On semi-perfect de Bruijn words

DOI10.1016/J.TCS.2018.02.008MaRDI QIDQ1704583zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Generalized de Bruijn words for primitive words and powers
• Burrows-Wheeler transformations and de Bruijn words
• De Bruijn Sequences and Perfect Factors
• Binary de Bruijn partial words with one hole
• de Bruijn sequences and de Bruijn graphs for a general language

Cites work

• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• On extending de Bruijn sequences
• On the maximum number of distinct factors of a binary string

Cited in

(2)

• Generalized de Bruijn words for primitive words and powers
• Extending de Bruijn sequences to larger alphabets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704583)