Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T18:00:02.447Z Has data issue: false hasContentIssue false

Generating Networks of Splicing Processors

Published online by Cambridge University Press:  30 July 2012

Jürgen Dassow
Affiliation:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, 39016 Magdeburg, Germany. dassow@iws.cs.uni-magdeburg.de, truthe@iws.cs.uni-magdeburg.de
Florin Manea
Affiliation:
Christian-Albrechts-Universität zu Kiel, Institut für Informatik, Christian-Albrechts-Platz 4, 24098 Kiel, Germany; flm@informatik.uni-kiel.deFaculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014 Bucharest, Romania
Bianca Truthe
Affiliation:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, PSF 4120, 39016 Magdeburg, Germany. dassow@iws.cs.uni-magdeburg.de, truthe@iws.cs.uni-magdeburg.de

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we introduce generating networks of splicing processors (GNSP for short),a formal languages generating model related to networks of evolutionary processors and toaccepting networks of splicing processors. We show that all recursively enumerablelanguages can be generated by GNSPs with only nine processors. We also show, by directsimulation, that two other variants of this computing model, where the communicationbetween processors is conducted in different ways, have the same computational power.