Computational completeness of hybrid networks of evolutionary processors with seven nodes

Artiom Alhazov, E. Csuhaj-Varjú, Carlos Mart́in-Vide, Yurii Rogozhin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with a language processor (an evolutionary processor), a set of words, an input filter and an output filter. The evolutionary 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, by improving our previous result, we prove that HNEPs with 7 nodes are able to generate any recursively enumerable language. We also show that the family of HNEPs with 2 nodes is not computationally complete.

Original languageEnglish
Title of host publicationDescriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008
PublisherUniversity of Prince Edward Island
Pages38-47
Number of pages10
ISBN (Print)9780919013568
Publication statusPublished - 2008
Event10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008 - Charlottetown, PE, Canada
Duration: Jul 16 2008Jul 18 2008

Other

Other10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008
CountryCanada
CityCharlottetown, PE
Period7/16/087/18/08

Fingerprint

Substitution reactions

Keywords

  • Hybrid networks of evolutionary processors
  • Size complexity
  • Small universal systems

ASJC Scopus subject areas

  • Software

Cite this

Alhazov, A., Csuhaj-Varjú, E., Mart́in-Vide, C., & Rogozhin, Y. (2008). Computational completeness of hybrid networks of evolutionary processors with seven nodes. In Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008 (pp. 38-47). University of Prince Edward Island.

Computational completeness of hybrid networks of evolutionary processors with seven nodes. / Alhazov, Artiom; Csuhaj-Varjú, E.; Mart́in-Vide, Carlos; Rogozhin, Yurii.

Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, 2008. p. 38-47.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alhazov, A, Csuhaj-Varjú, E, Mart́in-Vide, C & Rogozhin, Y 2008, Computational completeness of hybrid networks of evolutionary processors with seven nodes. in Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, pp. 38-47, 10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008, Charlottetown, PE, Canada, 7/16/08.
Alhazov A, Csuhaj-Varjú E, Mart́in-Vide C, Rogozhin Y. Computational completeness of hybrid networks of evolutionary processors with seven nodes. In Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island. 2008. p. 38-47
Alhazov, Artiom ; Csuhaj-Varjú, E. ; Mart́in-Vide, Carlos ; Rogozhin, Yurii. / Computational completeness of hybrid networks of evolutionary processors with seven nodes. Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008. University of Prince Edward Island, 2008. pp. 38-47
@inproceedings{6c3d9c1820494ab0b5dca3e589b694a2,
title = "Computational completeness of hybrid networks of evolutionary processors with seven nodes",
abstract = "A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with a language processor (an evolutionary processor), a set of words, an input filter and an output filter. The evolutionary 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, by improving our previous result, we prove that HNEPs with 7 nodes are able to generate any recursively enumerable language. We also show that the family of HNEPs with 2 nodes is not computationally complete.",
keywords = "Hybrid networks of evolutionary processors, Size complexity, Small universal systems",
author = "Artiom Alhazov and E. Csuhaj-Varj{\'u} and Carlos Mart́in-Vide and Yurii Rogozhin",
year = "2008",
language = "English",
isbn = "9780919013568",
pages = "38--47",
booktitle = "Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008",
publisher = "University of Prince Edward Island",

}

TY - GEN

T1 - Computational completeness of hybrid networks of evolutionary processors with seven nodes

AU - Alhazov, Artiom

AU - Csuhaj-Varjú, E.

AU - Mart́in-Vide, Carlos

AU - Rogozhin, Yurii

PY - 2008

Y1 - 2008

N2 - A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with a language processor (an evolutionary processor), a set of words, an input filter and an output filter. The evolutionary 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, by improving our previous result, we prove that HNEPs with 7 nodes are able to generate any recursively enumerable language. We also show that the family of HNEPs with 2 nodes is not computationally complete.

AB - A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with a language processor (an evolutionary processor), a set of words, an input filter and an output filter. The evolutionary 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, by improving our previous result, we prove that HNEPs with 7 nodes are able to generate any recursively enumerable language. We also show that the family of HNEPs with 2 nodes is not computationally complete.

KW - Hybrid networks of evolutionary processors

KW - Size complexity

KW - Small universal systems

UR - http://www.scopus.com/inward/record.url?scp=67650345955&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67650345955&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9780919013568

SP - 38

EP - 47

BT - Descriptional Complexity of Formal Systems - 10th International Workshop, DCFS 2008

PB - University of Prince Edward Island

ER -