Request file

Review/Citation:  KRÖTZSCH, M., MASOPUST, Tomáš, THOMAZO, M. On the Complexity of Universality for Partially Ordered NFAs. In: FALISZEWSKI, P., MUSCHOLL, A., NIEDERMEIER, R., eds. 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum fuer Informatik, 2016, 61:1-61:14. Leibniz International Proceedings in Informatics LIPIcs, 58. ISBN 978-3-95977-016-3. ISSN 1868-8969
Requested document:  Masopust1.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.