Algorithms for maximal existential and universal width Algorithms for maximal existential and universal width

Maximal existential width and maximal universal width provide methods of quantifying the amount of nondeterminism and parallelism, respectively, present in computations of an alternating finite automaton (AFA). In this paper, we primarily seek to understand the complexity landscape of the problems p...

Ausführliche Beschreibung