Journal of Computer and System Sciences
Modern Operating Systems
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
Detecting Deadlocks in Concurrent Systems
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On three variants of rewriting P systems
Theoretical Computer Science
Molecular computing paradigm – toward freedom from Turing's charm
Natural Computing: an international journal
Parallel Rewriting P Systems without Target Conflicts
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Hierarchies of parallel rewriting P systems: a survey
New Generation Computing - Membrane computing
| Hi-index | 0.00 |
We analyze P systems with different parallel methods for string rewriting. The notion of deadlock state is introduced when some rules with mixed target indications are simultaneously applied on a common string. The computational power of systems with and without deadlock is analyzed and a lower bound for the generative power is given, for some parallelism methods. Some open problems are also formulated.