Löwe, Jan-ThomasJan-ThomasLöweKutrib, MartinMartinKutrib2022-09-122001-02-072022-09-122000http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-6099https://jlupub.ub.uni-giessen.de/handle/jlupub/7574http://dx.doi.org/10.22029/jlupub-7008The capabilities of reliable computations in linear cellular arrays with communication failures are investigated in terms of pattern recognition. The defective processing elements (cells) that cause the misoperations are assumed to behave as follows. Dependent on the result of a self-diagnosis of their communication links they store their working state locally such that it becomes visible to the neighbors. A defective cell is not able to receive information via one of its both links to adjacent cells. The self-diagnosis is run once before the actual computation. Subsequently no more failures may occur in order to obtain a valid computation. We center our attention to patterns that are recognizable very fast, i.e. in real-time. It is well-known that real-time one-way arrays are strictly less powerful than real-time two-way arrays, but there is only little known on the range between these two devices. 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. CR Subject Classification (1998): F.1, F.4.3, B.6.1, E.1, B.8.1, C.4enIn Copyrightparallel pattern recognitionddc:004