Abstract
We study P systems with symport/antiport and a new model of purely catalytic P systems, called purely multi-catalytic P systems, when these devices use only one symbol. Our proofs use unique-sum sets, sets of integer numbers whose sum can only be obtained in a unique way with the elements of the set itself. We improve some results related to the descriptional complexity of the P systems with symport/antiport considered by us and we define one infinite hierarchy of computations. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Frisco, P. (2010). P systems and unique-sum sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6501 LNCS, pp. 208–225). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
