Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad. On the Complexity of Deciding Avoidability of Sets of Partial Words. In Volker Diekert, Dirk Nowotka, editors, Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings. Volume 5583 of Lecture Notes in Computer Science, pages 113-124, Springer, 2009. [doi]
@inproceedings{BlakeleyBGR09,
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 = {2009},
doi = {10.1007/978-3-642-02737-6_9},
url = {http://dx.doi.org/10.1007/978-3-642-02737-6_9},
researchr = {https://researchr.org/publication/BlakeleyBGR09},
cites = {0},
citedby = {0},
pages = {113-124},
booktitle = {Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings},
editor = {Volker Diekert and Dirk Nowotka},
volume = {5583},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02736-9},
}