On the complexity of deciding avoidability of sets of partial words

DOI10.1016/J.TCS.2010.09.006MaRDI QIDQ606993zbMATH OpenOpenAlexFDO

Authors Brandon Blakeley, F. Blanchet-Sadri, Josh Gunter, Narad Rampersad

Publication date 19 November 2010

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

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

zbMATH Keywords

computational complexitycombinatorics on wordsde Bruijn graphsNP-hard problemspartial wordsunavoidable sets

Mathematics Subject Classification ID

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

Recommendations

• On the Complexity of Deciding Avoidability of Sets of Partial Words
• Testing avoidability on sets of partial words is hard
• Unavoidable sets of partial words of uniform length
• Number of holes in unavoidable sets of partial words. II.
• scientific article; zbMATH DE number 6851884

Cites work

• scientific article; zbMATH DE number 41707 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1324671 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A proof of Golomb's conjecture for the de Bruijn graph
• Algorithmic Combinatorics on Partial Words
• Crucial words and the complexity of some extremal problems for sets of prohibited words
• Efficient string matching
• On the Complexity of Deciding Avoidability of Sets of Partial Words
• Relationships between nondeterministic and deterministic tape complexities
• Repetition-free words
• Simple deterministic wildcard matching
• Testing avoidability on sets of partial words is hard
• UNAVOIDABLE SETS OF CONSTANT LENGTH
• Unavoidable sets of partial words

Cited in

(12)

• On the Complexity of Deciding Avoidability of Sets of Partial Words
• scientific article; zbMATH DE number 5073567 (Why is no real title available?)
• On the Computational Complexity of Partial Word Automata Problems
• The complexity of unavoidable word patterns
• scientific article; zbMATH DE number 6851884 (Why is no real title available?)
• Number of holes in unavoidable sets of partial words. II.
• Testing avoidability on sets of partial words is hard
• Weak containment for partial words is coNP-complete
• On universal partial words
• Computational and proof complexity of partial string avoidability
• Van der Waerden's Theorem and Avoidability in Words
• Unavoidable sets of partial words of uniform length

This page was built for publication: On the complexity of deciding avoidability of sets of partial words

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