No label defined (Q3677178)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3898246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3898246 |
Statements
1984
0 references
systolic automata
0 references
systolic tree automata
0 references
Turing machine
0 references
systolic trellis automata
0 references
cellular automata
0 references
iterative arrays
0 references
Pascal triangles
0 references
real-time automata
0 references
processor distribution
0 references
0.852486789226532
0 references
0.8412957787513733
0 references
0.8315603733062744
0 references
0.8289715647697449
0 references
The paper begins with an introductory presentation and the possibilities of systolic automata. In section 2 the power and limitations of systolic tree automata are discussed -- including the power of nonhomogeneity and of nondeterminism, the regular language recognition by programmable systolic tree automata, and Turing machine characterization. The homogeneous systolic trellis automata and different characterizations of cellular automata, iterative arrays and parallel Turing machines in terms of systolic trellis automata, and of systolic trellis automata in terms of sequential Turing machines, are presented in section 3. A speed-up theorem for systolic trellis automata and the representation of computation processes for systolic automata by generalized Pascal triangles are then discussed. The homogeneous and nonhomogeneous real- time automata and the problem of processor distribution are presented in the last two sections. At the end some open problems are enunciated. [For the entire collection see Zbl 0544.00022.]
0 references