Communication for alternating machines
type: Item
instance of: scholarly article
title: Communication for alternating machines
zbMATH Open document ID: 0769.68022
DOI: 10.1007/BF01193576
author: Anna Slobodová
published in: Acta Informatica
publication date: 1993-02-16T00:00:00Z
review text: Properties of a model of parallel computation generalizing the concept of alternation (the so-called synchronized alternation) is investigated and several results are obtained. The model supports a simple form of communications (via states) among parallel processes. It seems to be a useful tool for investigating both nondeterminism and parallelism.
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 120175
zbMATH Keywords: communications among parallel processes
zbMATH Keywords: model of parallel computation
zbMATH Keywords: synchronized alternation
zbMATH Keywords: nondeterminism
MaRDI profile type: Publication
cites work: Q4091421
cites work: Alternation
cites work: Q5592246
cites work: On the power of alternation in automata theory
cites work: Tradeoffs for language recognition on alternating machines
cites work: ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
cites work: On the power of synchronization in parallel computations
cites work: Q4266537
cites work: Alternating Pushdown and Stack Automata
cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines
cites work: On alternation
cites work: Some properties of space-bounded synchronized alternating Turing machines with universal states only
cites work: One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages
cites work: On tape-bounded complexity classes and multihead finite automata
cites work: Q4029597
cites work: Q3031934
full work available at URL: https://doi.org/10.1007/bf01193576
OpenAlex ID: W2012783289
Recommended article: Q3795229
Recommended article: Q4472199
Recommended article: THE COMMUNICATION MACHINE
Recommended article: Communicating automata
Recommended article: Q3709880
Recommended article: On Communicating Finite-State Machines
Recommended article: Q4718227
Recommended article: Q5309563
description: scientific article; zbMATH DE number 120175