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

Besozzi, D., Ferretti, C., Mauri, G., & Zandron, C. (2002). Parallel Rewriting P Systems with Deadlock. In 8th International Workshop on DNA-Based Computers (pp.302-314). Berlin : Springer-Verlag [10.1007/3-540-36440-4_27].

Parallel Rewriting P Systems with Deadlock

BESOZZI, DANIELA;FERRETTI, CLAUDIO;MAURI, GIANCARLO;ZANDRON, CLAUDIO
2002

Abstract

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
No
slide + paper
Scientifica
parallel rewriting, P systems, deadlock
English
International Workshop on DNA-Based Computers
978-3-540-00531-5
Besozzi, D., Ferretti, C., Mauri, G., & Zandron, C. (2002). Parallel Rewriting P Systems with Deadlock. In 8th International Workshop on DNA-Based Computers (pp.302-314). Berlin : Springer-Verlag [10.1007/3-540-36440-4_27].
Besozzi, D; Ferretti, C; Mauri, G; Zandron, C
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10281/15682
Citazioni
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 7
Social impact