Deciding representability of sets of words of equal length

DOI10.1016/J.TCS.2012.12.042MaRDI QIDQ1939274zbMATH OpenOpenAlexFDO

Authors F. Blanchet-Sadri, Sean Simmons

Publication date 4 March 2013

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

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

zbMATH Keywords

complexity classes P and NPfactorpartial wordrepresentable setsubword

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Recommendations

• Deciding representability of sets of words of equal length
• Deciding representability of sets of words of equal length in polynomial time
• Computing minimum length representations of sets of words of uniform length
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• Computing generalized de Bruijn sequences

Cited in

(6)

• Computing generalized de Bruijn sequences
• Computing minimum length representations of sets of words of uniform length
• Sets represented as the length-n factors of a word
• Deciding representability of sets of words of equal length in polynomial time
• Computing Minimum Length Representations of Sets of Words of Uniform Length
• Deciding representability of sets of words of equal length

This page was built for publication: Deciding representability of sets of words of equal length

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