#### Filter Results:

#### Publication Year

2007

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to… (More)

We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-hard for any alphabet of size larger or equal to two, which is in contrast with the well known feasability results for unavoidability of a set of full words. We raise some related questions on avoidability of sets of partial words.

The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words. The theory of unavoidable sets has seen extensive study over the past twenty years. In this paper we extend the definition of unavoidable sets of words to… (More)

- ‹
- 1
- ›