Journal of Computer and System Sciences
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Parallel Rewriting P Systems without Target Conflicts
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Parallel Rewriting P Systems with Deadlock
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
| Hi-index | 0.00 |
The paper is about some families of rewriting P systems, where the application of evolution rules is extended from the classical sequential rewriting to the parallel one (as, for instance, in Lindenmayer systems). As a result, consistency problems for the communication of strings may arise. Three variants of parallel rewriting P systems (already present in the literature) are considered here, together with the strategies they use to face the communication problem, and some parallelism methods for string rewriting are defined. We give a survey of all known results about each variant and we state some relations among the three variants, thus establishing hierarchies of parallel rewriting P systems. Various open problems related to the subject are also presented.