Communication for alternating machines
From MaRDI portal
Publication:1203600
DOI10.1007/BF01193576zbMath0769.68022OpenAlexW2012783289MaRDI QIDQ1203600
Publication date: 16 February 1993
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01193576
nondeterminismsynchronized alternationmodel of parallel computationcommunications among parallel processes
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Synchronized tree automata ⋮ Deterministic versus nondeterministic space in terms of synchronized alternating machines ⋮ The Communication Hierarchy of Time and Space Bounded Parallel Machines ⋮ A communication hierarchy of parallel computations ⋮ Complexity of EOL structural equivalence ⋮ Complexity of E0L structural equivalence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- On the power of synchronization in parallel computations
- One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages
- On the power of alternation in automata theory
- Tradeoffs for language recognition on alternating machines
- On alternation
- Some properties of space-bounded synchronized alternating Turing machines with universal states only
- On tape-bounded complexity classes and multihead finite automata
- Alternating Pushdown and Stack Automata
- Alternation
- ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
This page was built for publication: Communication for alternating machines
