cfaed Publications
On the Complexity of Universality for Partially Ordered NFAs
Reference
Markus Krötzsch, Tomáš Masopust, Michaël Thomazo, "On the Complexity of Universality for Partially Ordered NFAs", Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) (Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 58, pp. 61:1–61:14, 2016. [doi]
Bibtex
@inproceedings{KMT2016,
author = {Markus Kr{\"{o}}tzsch and Tom{\'{a}}{\v{s}} Masopust and Micha{\"{e}}l Thomazo},
title = {On the Complexity of Universality for Partially Ordered {NFAs}},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
booktitle = {Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
series = {Leibniz International Proceedings in Informatics},
volume = {58},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2016},
pages = {61:1--61:14},
doi = {10.4230/LIPIcs.MFCS.2016.61}
}
author = {Markus Kr{\"{o}}tzsch and Tom{\'{a}}{\v{s}} Masopust and Micha{\"{e}}l Thomazo},
title = {On the Complexity of Universality for Partially Ordered {NFAs}},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
booktitle = {Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
series = {Leibniz International Proceedings in Informatics},
volume = {58},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2016},
pages = {61:1--61:14},
doi = {10.4230/LIPIcs.MFCS.2016.61}
}
Downloads
No Downloads available for this publication
Related Paths
Permalink
https://cfaed.tu-dresden.de/publications?pubId=1270