The connection machine
Towards a new architecture for symbolic processing
AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Handbook of formal languages, vol. 3
Handbook of Formal Languages
A Survey of Two-Dimensional Automata Theory
Proceedings of the 5th International Meeting of Young Computer Scientists on Machines, Languages, and Complexity
On the size complexity of universal accepting hybrid networks of evolutionary processors
Mathematical Structures in Computer Science
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
Natural Computing: an international journal
Hi-index | 0.00 |
In this paper we simplify the model of computation considered in [1], namely network of evolutionary picture processors, by moving the filters from the nodes to the edges. Each edge is now viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in such networks seems to be diminished. In spite of this observation all the results concerning the computational power of networks of evolutionary picture processors reported in [1] are extended over these simplified networks.