Abstract
De Bruijn sequences of order n represent the set A n of all words of length n over a given alphabet A in the sense that they contain occurrences of each of these words. Recently, the computational problem of representing subsets of A n by partial words, which are sequences that may have holes that match each letter of A, was considered and shown to be in \(\mathcal{NP}\). However, membership in \(\mathcal{P}\) remained open. In this paper, we show that deciding if a subset is representable can be done in polynomial time. Our approach is graph theoretical.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
