About complete obligatory hybrid networks of evolutionary processors without substitution

Authors:
Artiom Alhazov;Gemma Bel-Enguix;Alexander Krassovitskiy;Yurii Rogozhin
Affiliations:
Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Moldova;Rovira i Virgili University Research Group on Mathematical Linguistics, Tarragona, Spain;Rovira i Virgili University Research Group on Mathematical Linguistics, Tarragona, Spain;Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Moldova
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Year:
2011

Citing 7
Cited 0

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
Hybrid networks of evolutionary processors are computationally complete

Acta Informatica
On minimal context-free insertion-deletion systems

Journal of Automata, Languages and Combinatorics
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
Small universal accepting hybrid networks of evolutionary processors

Acta Informatica
Hybrid networks of evolutionary processors

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we consider complete obligatory hybrid networks of evolutionary processors (OHNEPs) with insertion and deletion operations (without substitution). Such networks are not computationally complete and we modify the notion of obligatory operation introduced in [1] in order to reach universality. We use very simple evolutionary processors with one modified operation of insertion or deletion per node (without substitution). Using techniques presented in the paper a universal complete OHNEP with 182 nodes can be constructed.