We further investigate the computing power of the recently introduced P systems with ℤ-multisets (also known as hybrid sets) as generative devices. These systems apply catalytic rules in the maximally parallel way, even consuming absent non-catalysts, thus effectively generating vectors of arbitrary (not just non-negative) integers. The rules may only be made inapplicable by dissolution rules. However, this releases the catalysts into the immediately outer region, where new rules might become applicable to them. We discuss the generative power of this model. Finally, we consider the variant with mobile catalysts.
Alhazov, A., Belingheri, O., Freund, R., Ivanov, S., Porreca, A., Zandron, C. (2017). Purely catalytic P systems over integers and their generative power. In Membrane Computing (pp.67-82). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-319-54072-6_5].
Purely catalytic P systems over integers and their generative power
Alhazov, A;Porreca, AE;Zandron, C
2017
Abstract
We further investigate the computing power of the recently introduced P systems with ℤ-multisets (also known as hybrid sets) as generative devices. These systems apply catalytic rules in the maximally parallel way, even consuming absent non-catalysts, thus effectively generating vectors of arbitrary (not just non-negative) integers. The rules may only be made inapplicable by dissolution rules. However, this releases the catalysts into the immediately outer region, where new rules might become applicable to them. We discuss the generative power of this model. Finally, we consider the variant with mobile catalysts.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
