Conditional Tabled Eco-Grammar Systems: the Scattered Contexts
✍ Scribed by Petr Sosík
- Book ID
- 110283899
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 83 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1572-848X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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.
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.