Number of holes in unavoidable sets of partial words II

Authors:
F. Blanchet-Sadri;Steven Ji;Elizabeth Reiland
Affiliations:
Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402-6170, USA;Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA;Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA 91711, USA
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 11
Cited 0

Combinatorics of words

Handbook of formal languages, vol. 1
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Unavoidable sets of words of uniform length

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Unavoidable sets

Theoretical Computer Science
A Second Course in Formal Languages and Automata Theory

A Second Course in Formal Languages and Automata Theory
Note: Testing avoidability on sets of partial words is hard

Theoretical Computer Science
Unavoidable Sets of Partial Words

Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
On the complexity of deciding avoidability of sets of partial words

Theoretical Computer Science
Minimum number of holes in unavoidable sets of partial words of size three

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Hard counting problems for partial words

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are concerned with the complexity of deciding the avoidability of sets of partial words over an arbitrary alphabet. Towards this, we investigate the minimum size of unavoidable sets of partial words with a fixed number of holes. Additionally, we analyze the complexity of variations on the decision problem when placing restrictions on the number of holes and length of the words.