In this paper we consider networks of evolutionary processors with splicing rules (NEPS) as language generating and computational devices. Such a network consists of several processors placed on the nodes of a virtual graph and are able to perform splicing (which is a biologically motivated operation) on the words present in that node, according to the splicing rules present there. Each node is associated with an input and output filter. When the filters are regular languages one gets the computational power of Turing machines with networks of size two. We also show how these networks can be used to solve NP-complete problems in linear time. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Choudhary, A., & Krithivasan, K. (2005). Network of evolutionary processors with splicing rules. In Lecture Notes in Computer Science (Vol. 3561, pp. 290–299). Springer Verlag. https://doi.org/10.1007/11499220_30
Mendeley helps you to discover research relevant for your work.