### 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. HNEPs can be considered as both language generating devices (GHNEPs) and language accepting devices (AHNEPs). In this paper, by improving the previous results, we prove that any recursively enumerable language can be determined by a GHNEP and an AHNEP with 7 nodes. We also show that the families of GHNEPs and AHNEPs with 2 nodes are not computationally complete.

Original language | English |
---|---|

Pages (from-to) | 3188-3197 |

Number of pages | 10 |

Journal | Theoretical Computer Science |

Volume | 410 |

Issue number | 35 |

DOIs | |

Publication status | Published - Aug 28 2009 |

### Fingerprint

### Keywords

- Computational completeness
- Hybrid networks of evolutionary processors
- Point mutations

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*410*(35), 3188-3197. https://doi.org/10.1016/j.tcs.2009.05.003