1. Lecture Notes in Computer Science;M. Berglund,2011
2. Bordihn, H., Kutrib, M., Malcher, A.: Undecidability and hierarchy results for parallel communicating finite automata. Int. J. Found. Comput. Sci. 22, 1577–1592 (2011)
3. Choudhary, A., Krithivasan, K., Mitrana, V.: Returning and non-returning parallel communicating finite automata are equivalent. Information Processing Letters 41, 137–145 (2007)
4. Csuhaj-Varju, E., Dassow, J.: On cooperating distributed grammar systems. J. Inform. Process. Cybern., EIK 26, 49–63 (1990)
5. Csuhaj-Varju, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems. A grammatical approach to distribution and cooperation. Gordon and Breach (1994)