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...

Full description

Saved in:

Bibliographic Details
Published in:	Natural computing Vol. 24; no. 3; pp. 541 - 556
Main Authors:	Alajaji, John, Salomaa, Kai
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.09.2025 Springer Nature B.V
Subjects:	Algorithms Artificial Intelligence Complex Systems Computation Computer Science Evolutionary Biology Integers Leaves Polynomials Processor Architectures Theory of Computation Trees Alternating finite automaton Measure of nondeterminism Decidability Universal and existential choices
ISSN:	1567-7818, 1572-9796
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!