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

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Natural computing Jg. 24; H. 3; S. 541 - 556
Hauptverfasser: Alajaji, John, Salomaa, Kai
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Springer Netherlands 01.09.2025
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 pertaining to computing these widths. One such problem involves deciding whether the maximal universal width or maximal existential width of an AFA is bounded by a given integer k . For the case of a nondeterministic finite automaton (NFA), we give a polynomial time algorithm for computing maximal existential width. We also present a polynomial time algorithm for computing the existential width of a general AFA, under the assumption that the AFA’s universal width is bounded by a fixed integer ℓ . Finally, we reconsider the problems of computing existential and universal widths for AFAs over a unary language and demonstrate that both problems can be solved in polynomial time.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-025-10022-z