Network of evolutionary processors with splicing rules

Authors:
Ashish Choudhary;Kamala Krithivasan
Affiliations:
Dept of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;Dept of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
IWINAC'05 Proceedings of the First international conference on Mechanisms, Symbols, and Models Underlying Cognition: interplay between natural and artificial computation - Volume Part I
Year:
2005

Citing 6
Cited 1

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Computing with membranes

Journal of Computer and System Sciences
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)

jNEPView: A Graphical Trace Viewer for the Simulations of NEPs

IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.