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.
