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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.