Constructions for alternating finite automata∗
type: Item
instance of: scholarly article
title: Constructions for alternating finite automata∗
zbMATH Open document ID: 0699.68081
DOI: 10.1080/00207169008803893
published in: International Journal of Computer Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4147527
zbMATH Keywords: alternating finite automata
zbMATH Keywords: nondeterminism
zbMATH Keywords: NFA with
zbMATH Keywords: nondeterministic starting state
zbMATH Keywords: Alternation
Wikidata QID: Q56431187
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1080/00207169008803893
OpenAlex ID: W2032001066
cites work: Alternation
cites work: Some observations concerning alternating Turing machines using small space
cites work: Q3862379
cites work: Alternating multicounter machines with constant number of reversals
cites work: On the power of alternation in automata theory
cites work: A note on alternating on-line Turing machines
cites work: Alternation and \(\omega\)-type Turing acceptors
cites work: Alternating Pushdown and Stack Automata
cites work: On alternation
cites work: Tree-size bounded alternation
cites work: Q3707407
cites work: Q4692941
DBLP publication ID: journals/ijcm/FellahJY90
description: scientific article; zbMATH DE number 4147527