𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Erzsébet Csuhaj-Varjú; György Vaszil

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
632 KB
Volume
215
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the computational power of context-fr
On the computational power of context-free PC grammar systems
✍ Niculae Mandache 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 132 KB

It is shown that non-returning parallel communicating grammar systems with -free contextfree components can generate any recursively enumerable language. Since it was proven that such systems can be simulated by returning PC grammar systems with context-free components, the result extends to those.