%0 Generic %D 2003 %T PC grammar systems with five context-free components generate all recursively enumerable languages %A Erzsebet Csuhaj-Varjú %A Gheorghe Paun %A György Vaszil %C Amsterdam (The Netherlands) %I Elsevier %K descriptional complexity %K parallel communicating grammar systems %K recursively enumerable languages %N 1-3 %P 785 - 794 %R 10.1016/S0304-3975(02)00852-6 %V 299 %X Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.