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

Sumsets
P Systems
Descriptional Complexity
Integer

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
Frisco, Pierluigi. / P systems and unique-sum sets. Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers. Vol. 6501 LNCS 2010. pp. 208-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b208e91027694e28960bc2244fe88685,
title = "P systems and unique-sum sets",
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. {\circledC} 2010 Springer-Verlag.",
author = "Pierluigi Frisco",
year = "2010",
doi = "10.1007/978-3-642-18123-8-17",
language = "English",
isbn = "3642181228",
volume = "6501 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "208--225",
booktitle = "Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers",

}

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

P systems and unique-sum sets. / Frisco, Pierluigi.

Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers. Vol. 6501 LNCS 2010. p. 208-225 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6501 LNCS).

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

TY - GEN

T1 - P systems and unique-sum sets

AU - Frisco, Pierluigi

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-18123-8-17

DO - 10.1007/978-3-642-18123-8-17

M3 - Conference contribution

SN - 3642181228

SN - 9783642181221

VL - 6501 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 208

EP - 225

BT - Membrane Computing - 11th International Conference, CMC 2010, Revised Selected Papers

ER -

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