Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 0.00 |
We look at the computational power of symport/antiport system (SA) acceptors and generators with small numbers of membranes and objects. We show that even with a single object and only three membranes, a SA acceptor can accept the nonsemilinear set L = {2ⁿ∣n ≥ 0}. L can also be accepted with two objects and only one membrane. This latter model can accept all unary semilinear (i.e., regular) sets. We also show that for any k ≥ 1, the class of sets of k-tuples of nonnegative integers accepted by partially blind (multi-) counter machines is a subclass of the class of sets of k-tuples accepted by 1-object multi-membrane SA acceptors. Similarly, the class of sets of k-tuples of nonnegative integers generated by partially blind counter machines is a subclass of the class of sets of k-tuples generated by 1-objectmulti-membrane SA generators. As a corollary, the unary semilinear sets are a proper subclass of the unary sets of numbers accepted by SA acceptors with one object and 8 membranes. Whether or not 1-object multi-membrane SA acceptors (resp., generators) are universal remains an interesting open question.