Massively Parallel Pattern Recognition with Link Failures

Authors:
Martin Kutrib;Jan-Thomas Löwe
Affiliations:
-;-
Venue:
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Year:
2000

Citing 11
Cited 1

Reliable computation with cellular automata

Journal of Computer and System Sciences
A simple three-dimensional real-time reliable cellular array

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Minimal time synchronization in restricted defective cellular automata

Journal of Information Processing and Cybernetics
The synchronization of nonuniform networks of finite automata

Information and Computation
Language not recognizable in real time by one-way cellular automata

Theoretical Computer Science
Some relations between massively parallel arrays

Parallel Computing - Special issue: cellular automata
Pushdown cellular automata

Theoretical Computer Science
Signals in one-dimensional cellular automata

Theoretical Computer Science - Special issue: cellular automata
Fault Tolerant Parallel Pattern Recognition

Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata
Fault tolerant cellular spaces

Journal of Computer and System Sciences
Fault tolerant cellular automata

Journal of Computer and System Sciences

Nature-based problems in cellular automata

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

The capabilities of reliable computations in linear cellular arrays with communication failures are investigated in terms of syntactical pattern recognition. In particular we consider very fast, i. e. real-time, computations. It is well-known that real-time one-way arrays are strictly less powerful than real-time two-way arrays. Here it is shown that the sets of patterns reliably recognizable by real-time arrays with link failures are strictly in between the sets of (intact) one-way and (intact) two-way arrays. Hence, the failures cannot be compensated in general but, on the other hand, do not decrease the computing power to that one of one-way arrays.