Width measures of alternating finite automata
type: Item
instance of: scholarly article
title: Width measures of alternating finite automata
DOI: 10.1007/978-3-030-93489-7_8
author: Chris Keeler
author: Kai Salomaa
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7614744
MaRDI profile type: Publication
full work available at URL: 978-3-030-93489-7 8
OpenAlex ID: W4205301710
cites work: Alternation
cites work: An alternating hierarchy for finite automata
cites work: Communication complexity method for measuring nondeterminism in finite automata
cites work: Alternation in two-way finite automata
cites work: Nondeterminism growth and state complexity
cites work: Alternating finite automata with limited universal branching
cites work: Combining limited parallelism and nondeterminism in alternating finite automata
cites work: Alternating Pushdown and Stack Automata
cites work: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
cites work: State Complexity of Finite Tree Width NFAs
cites work: On the degree of ambiguity of finite automata
description: scientific article; zbMATH DE number 7614744