We analyze P systems with diﬀerent 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.
|Titolo:||Parallel rewriting P systems with deadlock|
BESOZZI, DANIELA (Primo)
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2003|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|