Maximal existential and universal width

DOI10.7561/SACS.2023.1.53MaRDI QIDQ6588086zbMATH OpenFDO

Authors Casey Keeler, Kai Salomaa

Publication date 15 August 2024

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

zbMATH Keywords

decision problemsfinite automatonalternationuniversal and existential choices

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx)

Recommendations

• Alternating finite automata with limited universal branching
• Converting finite width AFAs to nondeterministic and universal finite automata
• Nondeterminism growth and state complexity
• Structural properties of NFAs and growth rates of nondeterminism measures
• Nondeterministic tree width of regular languages

Cited in

(1)

• Converting finite width AFAs to nondeterministic and universal finite automata

This page was built for publication: Maximal existential and universal width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588086)