作者: Petr Sosík , Andrei Păun , Alfonso Rodríguez-Patón , David Pérez
DOI: 10.1007/978-3-642-11467-0_30
关键词:
摘要: P systems with proteins on membranes are inspired closely by switching protein channels. This model of membrane computing using division has been previously shown to solve an NP-complete problem in polynomial time. In this paper we characterize the class problems solvable these time and show that it equals PSPACE. Therefore, computationally equivalent (up a reduction) alternating Turing machine or PRAM computer. The proof technique employ reveals also some interesting trade-offs between certain system properties, as antiport rules, labeling polarization presence proteins.