Width measures of alternating finite automata

DOI10.1007/978-3-030-93489-7_8MaRDI QIDQ2096586zbMATH OpenOpenAlexFDO

Authors Chris Keeler, Kai Salomaa

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)

Cites work

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

Cited in

(1)

• Existential and universal width of alternating finite automata

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

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