On the computational completeness of context-free parallel communicating grammar systems

Erzsébet Csuhaj-Varjú, György Vaszil
1999 Theoretical Computer Science  
We prove that all recursively enumerable languages can be generated by context-free returning parallel communicating grammar systems by showing how the parallel communicating grammars can simulate two-counter machines, a class of Turing machine variants which is known to be computationally complete. Moreover, we prove that systems with a bounded number of components are sufficient to reach this generative power. @ 1999-Elsevier Science B.V. All rights reserved
doi:10.1016/s0304-3975(98)00193-5 fatcat:uuu3eiez4vdzbmli2x5tkm2qwm