Unavoidable sets of words of uniform length

Authors:
C. J. Saker;P. M. Higgins
Affiliations:
Univ. of Essex, United Kingdom;Univ. of Essex, United Kingdom
Venue:
Information and Computation
Year:
2002

Citing 1
Cited 5

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

Crucial words and the complexity of some extremal problems for sets of prohibited words

Journal of Combinatorial Theory Series A
Unavoidable sets

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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of words X over a finite alphabet A is said to be unavoidable if all but finitely many words in A have a factor in X. We examine the problem of calculating the cardinality of minimal unavoidable sets of words of uniform length; we correct an error in [8], state a conjecture offering a formula for the minimum size of these so called n-good sets for all values of n, and show that the conjecture is correct in an infinite number of cases.