AbstractWe prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-hard for any alphabet of size larger than 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 theore...
The partial string avoidability problem, also known as partial word avoidability, is stated as follo...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-har...
We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-har...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
AbstractBlanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidabil...
We are concerned with the complexity of deciding the avoidability of sets of partial words over an a...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
Bibliography: pages 192-195The avoidability, or unavoidability of patterns in words over finite alph...
AbstractBlanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidabil...
AbstractPartial words are sequences over a finite alphabet that may contain some undefined positions...
The partial string avoidability problem, also known as partial word avoidability, is stated as follo...
Partial words are sequences over a finite alphabet that may contain some undefined positions called ...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The partial string avoidability problem, also known as partial word avoidability, is stated as follo...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-har...
We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-har...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
AbstractBlanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidabil...
We are concerned with the complexity of deciding the avoidability of sets of partial words over an a...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
Bibliography: pages 192-195The avoidability, or unavoidability of patterns in words over finite alph...
AbstractBlanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidabil...
AbstractPartial words are sequences over a finite alphabet that may contain some undefined positions...
The partial string avoidability problem, also known as partial word avoidability, is stated as follo...
Partial words are sequences over a finite alphabet that may contain some undefined positions called ...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The partial string avoidability problem, also known as partial word avoidability, is stated as follo...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
DOI
Add to ORKG