0485287 - MÚ 2019 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Masopust, Tomáš - Krötzsch, M.Deciding Universality of ptNFAs is PSpace-Complete.
SOFSEM 2018: Theory and Practice of Computer Science. Cham: Springer, 2018 - (Tjoa, A.; Bellatreche, L.; Biffl, S.; van Leeuwen, J.; Wiedermann, J.), s. 413-427. Lecture Notes in Computer Science, 10706. ISBN 978-3-319-73116-2. ISSN 0302-9743.
[Sofsem 2018. International Conference on Current Trends in Theory and Practice of Computer Science /44./. Krems (AT), 29.01.2018-02.02.2018]
Institucionální podpora: RVO:67985840
Klíčová slova: nondeterministic automata * partial order * universality
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://link.springer.com/chapter/10.1007%2F978-3-319-73117-9_29
Trvalý link: http://hdl.handle.net/11104/0280357
