| Issue |
RAIRO-Theor. Inf. Appl.
Volume 46, Number 4, October-December 2012
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
|
|
|---|---|---|
| Page(s) | 547 - 572 | |
| DOI | https://doi.org/10.1051/ita/2012016 | |
| Published online | 30 July 2012 | |
Generating Networks of Splicing Processors
1
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
2
Christian-Albrechts-Universität zu Kiel, Institut für
Informatik, Christian-Albrechts-Platz 4, 24098
Kiel,
Germany
flm@informatik.uni-kiel.de
3
Faculty of Mathematics and Computer Science, University of
Bucharest, Academiei
14, 010014
Bucharest,
Romania
Received:
9
November
2011
Accepted:
6
June
2012
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 to accepting networks of splicing processors. We show that all recursively enumerable languages can be generated by GNSPs with only nine processors. We also show, by direct simulation, that two other variants of this computing model, where the communication between processors is conducted in different ways, have the same computational power.
Mathematics Subject Classification: 68Q05 / 68Q42 / 68Q45
Key words: Splicing / networks of splicing processors / networks of splicing processors with filtered connections / computational completeness
© EDP Sciences 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.