Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1051/ita/2012016 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | DocType | Volume |
Splicing,networks of splicing processors,networks of splicing processors with filtered connections,computational completeness | Conference | 46 |
Issue | ISSN | Citations |
SP4 | 0988-3754 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jürgen Dassow | 1 | 530 | 118.27 |
Florin Manea | 2 | 372 | 58.12 |
Bianca Truthe | 3 | 159 | 28.57 |