### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 349-358 |

Number of pages | 10 |

Journal | Theoretical Computer Science |

Volume | 215 |

Issue number | 1-2 |

Publication status | Published - Feb 28 1999 |

### Fingerprint

### Keywords

- Computational completeness
- Distributed computation
- Parallel communicating grammar systems

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Theoretical Computer Science*,

*215*(1-2), 349-358.

**On the computational completeness of context-free parallel communicating grammar systems.** / Csuhaj-Varjú, Erzsébet; Vaszil, György.

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 215, no. 1-2, pp. 349-358.

}

TY - JOUR

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

AU - Csuhaj-Varjú, Erzsébet

AU - Vaszil, György

PY - 1999/2/28

Y1 - 1999/2/28

N2 - 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.

AB - 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.

KW - Computational completeness

KW - Distributed computation

KW - Parallel communicating grammar systems

UR - http://www.scopus.com/inward/record.url?scp=0346304138&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346304138&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0346304138

VL - 215

SP - 349

EP - 358

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -