Abstract.
Networks of parallel language processors form a special type of grammar systems where derivation steps in the mode of L systems and communication steps alternate. Hitherto only networks have been considered where the underlying graph is the complete graph. In this paper  we consider networks of parallel languages where the underlying graph is a star, a grid, or a ring; these are very common structures in network theory. We show that these graphs have the same power as the complete graph.