𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the synchronization in parallel communicating grammar systems

✍ Scribed by Gheorghe Păun

Publisher
Springer-Verlag
Year
1993
Tongue
English
Weight
848 KB
Volume
30
Category
Article
ISSN
0001-5903

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.

Trading Independent for Synchronized Par
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems
✍ Giorgio Satta 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 626 KB

The so-called family of finite copying parallel rewriting systems is considered in this work, including well-known generative devices and transducers as for instance the deterministic tree-walking transducers, the string generating context-free hypergraph grammars, and the multiple context-free gram