Unavoidable sets

Authors:
Peter M. Higgins;Christopher J. Saker
Affiliations:
Department of Mathematics, University of Essex, Colchester, England;Department of Mathematics, University of Essex, Colchester, England
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 3

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
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)

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

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	5.23

Visualization

Abstract

We obtain new results on minimum lengths of words in an unavoidable set of words of cardinality n before introducing the notion of aperiodic unavoidable sets, a natural extension of unavoidable sets.