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.