On the communication-efficiency of parallel systems
β Scribed by Lin Hong; Chen Guoliang; Wang Min
- Publisher
- Wuhan University
- Year
- 1996
- Tongue
- English
- Weight
- 274 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
Rapid increases in the complexity of algorithms for real-time signal processing applications have led to performance requirements exceeding the capabilities of conventional digital signal processor (DSP) architectures. Many applications, such as autonomous sonar arrays, are distributed in nature and