Evolution-Communication P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines
Computation: finite and infinite machines
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Partial halting in P systems using membrane rules with permitting contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Properties of membrane systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
| Hi-index | 0.00 |
Proton pumping P systems are a variant of membrane systems with both rewriting rules and symport/antiport rules, where a set of objects called protons is distinguished, every cooperative symport or antiport rule involves a proton, but no rewriting rule does. Time-freeness property means the result of all computations does not depend on the time it takes to execute the rules. The goal of this article is to improve (showing that two membranes are sufficient) the known universality results on proton pumping P systems, establishing at the same time an upper bound on the number of protons, namely one, or four for time-free systems. All results mentioned hold for proton pumping P systems with non-cooperative rewriting and either symport/antiport rules of weight one (classical variant) or symport rules of weight at most two. As a corollary, we obtain the universality of P systems with one membrane and one bi-stable catalyst, or the universality of time-free P systems with one membrane and four bi-stable catalysts. All universality results are stated as generating RE (except the time-free systems without targets generate PsRE).