Multiprocessor automata
From MaRDI portal
Publication:1108012
DOI10.1016/0020-0190(87)90172-4zbMath0653.68044OpenAlexW2912200930MaRDI QIDQ1108012
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90172-4
switching functionmultihead automatonformal languages hierarchymodel of parallel computationsmultiprocessor automata
Related Items (8)
PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS ⋮ UNDECIDABILITY AND HIERARCHY RESULTS FOR PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ ON THE COMPUTATIONAL CAPACITY OF PARALLEL COMMUNICATING FINITE AUTOMATA ⋮ Complexity of multi-head finite automata: origins and directions ⋮ On the Computational Capacity of Parallel Communicating Finite Automata ⋮ PARALLEL FINITE AUTOMATA SYSTEMS COMMUNICATING BY STATES ⋮ Returning and non-returning parallel communicating finite automata are equivalent ⋮ Some undecidable problems for parallel communicating finite automata systems
Cites Work
This page was built for publication: Multiprocessor automata
