About Universal Hybrid Networks of Evolutionary Processors of Small Size

Authors:
Artiom Alhazov;Erzsébet Csuhaj-Varjú;Carlos Martín-Vide;Yurii Rogozhin
Affiliations:
Department of Information Technologies, Turku Center for Computer Science, Åbo Akademi University, Turku, Finland FIN-20520 and Institute of Mathematics and Computer Science, Academy of Scien ...;Hungarian Academy of Sciences, Computer and Automation Research Institute, Budapest, Hungary 1111 and Faculty of Informatics, Department of Algorithms and Their Applications, Eötvös Lor& ...;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain 43005;Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain 43005 and Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişină ...
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 5
Cited 0

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
New Small Universal Circular Post Machines

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Hybrid networks of evolutionary processors are computationally complete

Acta Informatica
On the number of nodes in universal networks of evolutionary processors

Acta Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hybrid network of evolutionary processors (an HNEP) is a graph with a language processor, input and output filters associated to each node. A language processor performs one type of point mutations (insertion, deletion or substitution) on the words in that node. The filters are defined by certain variants of random-context conditions. In this paper, we present a universal complete HNEP with 10 nodes simulating circular Post machines and show that every recursively enumerable language can be generated by a complete HNEP with 10 nodes. Thus, we positively answer the question posed in [5] about the possibility to generate an arbitrary recursively enumerable language over an alphabet Vwith a complete HNEP of a size smaller than 27 + 3·card(V).