On the Computational Complexity of Context-free Parallel Communicating Grammar Systems

By Stefan D. Bruda, this paper appeared in Springer Lecture Notes in Computer Science 1218.