Abstract.
In this paper we consider networks of evolutionary processors as language generating and computational devices. When the filters are regular languages one gets the computational power of Turing machines with networks of size at most six, depending on the underlying graph. When the filters are defined by random context conditions, we obtain an incomparability result with the families of regular and context-free languages. Despite their simplicity, we show how the latter networks might be used for solving an NP-complete problem, namely the “3-colorability problem”, in linear time and linear resources (nodes, symbols, rules).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 26 September 2002 / 22 January 2003
RID="*"
ID="*" Work supported by the Generalitat de Catalunya, Direcció General de Recerca (PIV2001-50).
Rights and permissions
About this article
Cite this article
Castellanos, J., Martín-Vide, C., Mitrana, V. et al. Networks of evolutionary processors. Acta Informatica 39, 517–529 (2003). https://doi.org/10.1007/s00236-003-0114-y
Issue Date:
DOI: https://doi.org/10.1007/s00236-003-0114-y