On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes

Authors:
Victor Mitrana;Bianca Truthe
Affiliations:
Faculty of Mathematics, University of Bucharest, Bucharest, Romania 70109 and Department of Information Systems and Computation, Technical University of Valencia, Valencia, Spain 46022;Faculty of Computer Science, University of Magdeburg, Magdeburg, Germany 39016
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 6
Cited 2

The connection machine

The connection machine
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
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size

Information Processing Letters
On Networks of Evolutionary Processors with Nodes of Two Types

Fundamenta Informaticae - Machines, Computations and Universality, Part I
Accepting hybrid networks of evolutionary processors

DNA'04 Proceedings of the 10th international conference on DNA computing

Target Based Accepting Networks of Evolutionary Processors

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the computational power of accepting networks of evolutionary processors (ANEP for short) with filters defined in two ways: by regular sets and random contexts conditions, respectively. We consider ANEPs with all the nodes specialized in only one evolutionary operation (substitution, insertion and deletion) or in two operations out of these three.