Authors: Alhazov Artiom,
Rogojin Iurie
Abstract
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an input filter and an output filter. Every evolutionary processor is given with a finite set of one type of point mutations (an insertion, a deletion or a substitution of a symbol) which can be applied to certain positions of a string over the domain of the set of these rewriting rules. The HNEP functions by rewriting the words that can be found at the nodes and then re-distributing the resulting strings according to a communication protocol based on a filtering mechanism. The filters are defined by certain variants of random-context conditions. In this paper we complete investigation of HNEPs with one node and present a precise description of languages generated by them.
Dr. Artiom Alhazov
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD 2028, Moldova
E-mail:
Dr. hab. Yurii Rogozhin
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD 2028, Moldova
E-mail:
Research Group on Mathematical Linguistics
Rovira i Virgili University
Pl.Imperial Tarraco, 1, Tarragona, Spain
Fulltext
–
0.17 Mb