P systems and unique-sum sets

Pierluigi Frisco

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationMembrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers
Pages208-225
Number of pages18
Volume6501 LNCS
DOIs
Publication statusPublished - 2010
Event11th International Conference on Membrane Computing - Jena, Germany
Duration: 24 Aug 201027 Aug 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6501 LNCS
ISSN (Print)0302-9743

Conference

Conference11th International Conference on Membrane Computing
Abbreviated titleCMC 2010
CountryGermany
CityJena
Period24/08/1027/08/10

Fingerprint Dive into the research topics of 'P systems and unique-sum sets'. Together they form a unique fingerprint.

  • Cite this

    Frisco, P. (2010). P systems and unique-sum sets. In Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers (Vol. 6501 LNCS, pp. 208-225). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6501 LNCS). https://doi.org/10.1007/978-3-642-18123-8-17