Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
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
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
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
How Redundant Is Your Universal Computation Device?
Membrane Computing
A small universal splicing P system
CMC'10 Proceedings of the 11th international conference on Membrane computing
Minimization strategies for maximally parallel multiset rewriting systems
Theoretical Computer Science
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Time-free solution to SAT problem using P systems with active membranes
Theoretical Computer Science
| Hi-index | 5.23 |
It is known that P systems with antiport rules simulate register machines, i.e., they are computationally complete. Hence, due to the existence of universal register machines, there exist computationally complete subclasses of antiport P systems with bounded size, i.e., systems where each size parameter is limited by some constant. However, so far there has been no estimation of these numbers given in the literature. In this article, three universal antiport P systems of bounded size are demonstrated, different from each other in their size parameters. We present universal antiport P systems with 73, 43, and 30 rules where the maximum of the weight of the rules is 4, 5, and 6, respectively.