On the Complexity of Deciding Avoidability of Sets of Partial Words
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad
On the Complexity of Deciding Avoidability of Sets of Partial Words
DLT, 2009.

DLT 2009
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{DLT-2009-BlakeleyBGR,
	author        = "Brandon Blakeley and Francine Blanchet-Sadri and Josh Gunter and Narad Rampersad",
	booktitle     = "{Proceedings of the 13th International Conference on Developments in Language Theory}",
	doi           = "10.1007/978-3-642-02737-6_9",
	isbn          = "978-3-642-02736-9",
	pages         = "113--124",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{On the Complexity of Deciding Avoidability of Sets of Partial Words}",
	volume        = 5583,
	year          = 2009,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.