Eliminating Communication by Parallel Rewriting

Authors:
Branislav Rovan;Marián Slast'an
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 3
Cited 0

Communication complexity and parallel computing

Communication complexity and parallel computing
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
A Framework for Studying Grammars

Proceedings on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We shall showthat simple communication can be substituted by parallel rewriting and nondeterminism without a time penalty. This is no longer true for more complex communication. In particular, we shall show that time preserving simulation of regular PCGS by g-systems is possible whereas time preserving simulation of context-free PCGS is impossible.