On the computational power of insertion-deletion systems
✍ Scribed by Akihiro Takahara; Takashi Yokomori
- Book ID
- 111601408
- Publisher
- Springer Netherlands
- Year
- 2003
- Tongue
- English
- Weight
- 108 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1567-7818
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The computational power of self-stabilizing distributed systems is examined. Assuming availability of any number of processors, each with (small) constant size memory we show that any computable problem can be realized in a self-stabilizing fashion. The result is derived by presenting a distributed
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.