Francine Blanchet-Sadri, Sinziana Munteanu. Deciding Representability of Sets of Words of Equal Length in Polynomial Time. In Thierry Lecroq, Laurent Mouchard, editors, Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers. Volume 8288 of Lecture Notes in Computer Science, pages 28-40, Springer, 2013. [doi]
@inproceedings{Blanchet-SadriM13,
title = {Deciding Representability of Sets of Words of Equal Length in Polynomial Time},
author = {Francine Blanchet-Sadri and Sinziana Munteanu},
year = {2013},
doi = {10.1007/978-3-642-45278-9_4},
url = {http://dx.doi.org/10.1007/978-3-642-45278-9_4},
researchr = {https://researchr.org/publication/Blanchet-SadriM13},
cites = {0},
citedby = {0},
pages = {28-40},
booktitle = {Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers},
editor = {Thierry Lecroq and Laurent Mouchard},
volume = {8288},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-45277-2},
}