A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the computational complexity of membrane systems
2004
Theoretical Computer Science
We show how techniques in machine-based complexity can be used to analyze the complexity of membrane computing systems. We focus on catalytic systems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal. We deÿne space and time complexity measures and show hierarchies of complexity classes similar to well-known results concerning Turing machines and counter machines. We also show that the deterministic
doi:10.1016/j.tcs.2004.03.045
fatcat:6gm6hnd2grb4tbo4v2r5ljs2xm