Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Testing primitivity on partial words
Discrete Applied Mathematics
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On minimal Sturmian partial words
Discrete Applied Mathematics
Constructing partial words with subword complexities not achievable by full words
Theoretical Computer Science
Number of holes in unavoidable sets of partial words II
Journal of Discrete Algorithms
Connecting partial words and regular languages
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences
Regular languages of partial words
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this paper we approach several decision and counting problems related to partial words, from a computational point of view. First we show that finding a full word that is not compatible with any word from a given list of partial words, all having the same length, is NP-complete; from this we derive that counting the number of words that are compatible with at least one word from a given list of partial words, all having the same length, is #P-complete. We continue by showing that some other related problems are also #P-complete; from these we mention here only two: counting all the distinct full words of a given length compatible with at least one factor of the given partial word, and counting all the distinct squares compatible with at least a factor of a given partial word.