When catalytic P systems with one catalyst can be computationally complete - Archive ouverte HAL Access content directly
Journal Articles Journal of Membrane Computing Year : 2021

When catalytic P systems with one catalyst can be computationally complete

(1) , (2) , (3)
1
2
3

Abstract

Catalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects , i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.

Dates and versions

hal-03320415 , version 1 (15-08-2021)

Identifiers

Cite

Artiom Alhazov, Rudolf Freund, Sergiu Ivanov. When catalytic P systems with one catalyst can be computationally complete. Journal of Membrane Computing, 2021, 3, pp.170--181. ⟨10.1007/s41965-021-00079-x⟩. ⟨hal-03320415⟩
62 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More