On the Complexity of Deciding Avoidability of Sets of Partial Words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret. Comput. Sci. 410 (2009) 968

• Type: Journal
• Year: 2009
• Where: DLT
• Authors: Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
• Keywords: DLT 2009, Finite Set, Partial Words, Polynomial, Theoretical Computer Science