On the complexity of deciding avoidability of sets of partial words

Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad. On the complexity of deciding avoidability of sets of partial words. Theoretical Computer Science, 411(49):4263-4271, 2010. [doi]

Authors

Brandon Blakeley

This author has not been identified. Look up 'Brandon Blakeley' in Google

Francine Blanchet-Sadri

This author has not been identified. Look up 'Francine Blanchet-Sadri' in Google

Josh Gunter

This author has not been identified. Look up 'Josh Gunter' in Google

Narad Rampersad

This author has not been identified. Look up 'Narad Rampersad' in Google