P Systems, Petri Nets, and Program Machines

Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtained results are not limited to P systems.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Frisco, Pierluigi
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Some features capturing the computational completeness of P systems with maximal parallelism, priorities or zero-test using symbol objects are studied through Petri nets. The obtained results are not limited to P systems.
ISSN:0302-9743
1611-3349
DOI:10.1007/11603047_15