On a hierarchy of languages generated by cooperating distributed grammar systems
For cooperating distributed grammar systems working in = k-mode up to now it is only known that this mode can be simulated by the = k . l-mode for l > 1. In this note we show how to improve this simulation when a termination condition is additionally required, showing that the (t boolean AND = k)-mode can be simulated by the (t boolean AND = k + l)-mode if the number of components in the underlying cooperating distributed grammar system is increased by two, A similar result is given for the (t boolean AND less than or equal to k)-mode. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
distributed systems formal languages