Back to Results
First PageMeta Content
Computational complexity theory / Finite automata / Complexity classes / Theory of computation / Nondeterministic finite automaton / Regular language / PSPACE / Bchi automaton / FO / Permutation / IP / Structure


On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing
Add to Reading List

Document Date: 2016-06-13 07:14:39


Open Document

File Size: 585,14 KB

Share Result on Facebook
UPDATE