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.

• Type: Conference
• Year: 2005
• Where: MEMBRANE
• Authors: Pierluigi Frisco
• Keywords: Computational Completeness, Maximal Parallelism, MEMBRANE 2005, Symbol Objects