Width measures of alternating finite automata

DOI10.1007/978-3-030-93489-7_8OpenAlexW4205301710MaRDI QIDQ2096586

Kai Salomaa, Chris Keeler

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93489-7_8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Existential and universal width of alternating finite automata

Cites Work

• An alternating hierarchy for finite automata
• Alternating finite automata with limited universal branching
• On the degree of ambiguity of finite automata
• Communication complexity method for measuring nondeterminism in finite automata
• Alternation in two-way finite automata
• Combining limited parallelism and nondeterminism in alternating finite automata
• Nondeterminism growth and state complexity
• Alternating Pushdown and Stack Automata
• Alternation
• Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
• State Complexity of Finite Tree Width NFAs

This page was built for publication: Width measures of alternating finite automata