Deciding Universality of ptNFAs is PSpace-Complete

Tomás Masopust, Markus Krötzsch. Deciding Universality of ptNFAs is PSpace-Complete. In A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jirí Wiedermann, editors, SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings. Volume 10706 of Lecture Notes in Computer Science, pages 413-427, Springer, 2018. [doi]

Authors

Tomás Masopust

This author has not been identified. Look up 'Tomás Masopust' in Google

Markus Krötzsch

This author has not been identified. Look up 'Markus Krötzsch' in Google