Multiprocessor automata (Q1108012)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiprocessor automata |
scientific article; zbMATH DE number 4066338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiprocessor automata |
scientific article; zbMATH DE number 4066338 |
Statements
Multiprocessor automata (English)
0 references
1987
0 references
The notion of multiprocessor automata is introduced. The multiprocessor automaton may be thought of as the simplest model of parallel computations: there are more than one processors reading information from the tape simultaneously, and the switching function for each processor depends on the inner states of all processors on the step of computations. We prove some results on the hierarchies of two-way and one-way multiprocessor automata languages.
0 references
multihead automaton
0 references
formal languages hierarchy
0 references
multiprocessor automata
0 references
model of parallel computations
0 references
switching function
0 references
0.7697039246559143
0 references
