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
Information Processing Letters
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
Accepting Networks of Non-inserting Evolutionary Processors
Transactions on Computational Systems Biology XI
Theory of Computing Systems
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
Accepting Networks of Genetic Processors are computationally complete
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we investigate the role of evolutionary operations in accepting hybrid networks of evolutionary processors (AHNEP for short) in the following way. We consider AHNEPs with all the nodes specialized in only one evolutionary operation (substitution, insertion, or deletion) or in two operations out of these three. The considered variants differ in two respects: filters that are used to control the exchange of information (we use random context conditions and regular languages as filters) and the way of accepting the input word (at least one output node or all output nodes are non-empty at some moment in the computation). The computational power of all these variants is studied.