Request file

Review/Citation:  MASOPUST, Tomáš, KRÖTZSCH, M. Deciding Universality of ptNFAs is PSpace-Complete. In: TJOA, A., BELLATRECHE, L., BIFFL, S., VAN LEEUWEN, J., WIEDERMANN, J., eds. SOFSEM 2018: Theory and Practice of Computer Science. Cham: Springer, 2018, s. 413-427. Lecture Notes in Computer Science, 10706. ISBN 978-3-319-73116-2. ISSN 0302-9743
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.