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
Journal of Computer and System Sciences
Handbook of Formal Languages
Networks of Parallel Language Processors
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
On Networks of Evolutionary Processors with Nodes of Two Types
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
Complexity results for deciding Networks of Evolutionary Processors
Theoretical Computer Science
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Hi-index | 0.00 |
In this paper we show that some aspects of networks of evolutionary processors can be normalized or simplified without loosing generative power. More precisely, we show that one can use very small finite automata for the control of the communication. We first prove that the networks with evolutionary processors remain computationally complete if one restricts the control automata to have only one state, but underlying graphs of the networks have no fixed structure and the rules are applied in three different modes. Moreover, we show that networks where the rules are applied arbitrary, and all the automata for control have one state, cannot generate all recursively enumerable languages. Finally, we show that one can generate all recursively enumerable languages by complete networks, where the rules are applied arbitrary, but the automata for control have at most two states.