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]
@article{BlakeleyBGR10,
title = {On the complexity of deciding avoidability of sets of partial words},
author = {Brandon Blakeley and Francine Blanchet-Sadri and Josh Gunter and Narad Rampersad},
year = {2010},
doi = {10.1016/j.tcs.2010.09.006},
url = {http://dx.doi.org/10.1016/j.tcs.2010.09.006},
researchr = {https://researchr.org/publication/BlakeleyBGR10},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {411},
number = {49},
pages = {4263-4271},
}