About P systems with symport/antiport |
| |
Authors: | Pierluigi Frisco |
| |
Affiliation: | (1) Leiden University, LIACS, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands |
| |
Abstract: | It is proved that four membranes suffice to a variant of P systems with symport/antiport with maximal parallelism to generate all recursively enumerable sets of numbers. P systems with symport/antiport without maximal parallelism are also studied, considering two termination criteria. |
| |
Keywords: | Membrane computing Turing computability Symport/Antiport Counter automaton |
本文献已被 SpringerLink 等数据库收录! |
|