𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel Communicating Grammar Systems with Incomplete Information Communication

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

Book ID
110415333
Publisher
Springer
Year
2002
Tongue
English
Weight
168 KB
Volume
5
Category
Article
ISSN
1572-848X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the computational completeness of con
On the computational completeness of context-free parallel communicating grammar systems
✍ Erzsébet Csuhaj-Varjú; György Vaszil 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 632 KB

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.