Handbook of formal languages, vol. 1
Inventories of unavoidable languages and the word-extension conjecture
Theoretical Computer Science
Unavoidable sets of words of uniform length
Information and Computation
Crucial words and the complexity of some extremal problems for sets of prohibited words
Journal of Combinatorial Theory Series A
Theoretical Computer Science
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
Algorithmic Combinatorics on Partial Words (Discrete Mathematics and Its Applications)
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
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Number of holes in unavoidable sets of partial words I
Journal of Discrete Algorithms
Number of holes in unavoidable sets of partial words II
Journal of Discrete Algorithms
Hi-index | 0.00 |
Partial words are sequences over a finite alphabet that may contain some undefined positions called holes. In this paper, we consider unavoidable sets of partial words of equal length. We compute the minimum number of holes in sets of size three over a binary alphabet (summed over all partial words in the sets). We also construct all sets that achieve this minimum. This is a step towards the difficult problem of fully characterizing all unavoidable sets of partial words of size three.