Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
The power of communication: P systems with symport/antiport
New Generation Computing
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Towards a characterization of p systems with minimal symport/antiport and two membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the size of p systems with minimal symport/antiport
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Tissue p systems with minimal symport/antiport
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Skin output in P systems with minimal symport/antiport and two membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
Towards a characterization of p systems with minimal symport/antiport and two membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems (purely symport P systems) with two membranes and minimal cooperation generate any recursively enumerable sets of natural numbers without zero. Thus we improve our previous results for symport/antiport P systems with two membranes and minimal cooperation from three “garbage” objects down to one object and for purely symport P systems from six objects down to one object. Thus we show the optimality of these results.