Catalytic P systems is one of the basic classes of P systems. The number of catalysts required for optimal universality results (both in pure catalytic systems and catalytic systems) has been a problem of extensive research [3], [5], [6], [7], [12]. The differences that can give universality/non-universality are very small in these systems, and finding this borderline is one of the 'jewel' problems in P systems [12]. In this paper, we try to figure out this borderline and have obtained some interesting results. We have proved that with 2 catalysts, if λ-rules are not used, then universality cannot be obtained. We also consider two restricted variants of pure catalytic systems and prove that they are also not universal. Finally, we look at mobile catalytic systems and solve two open problems. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Krishna, S. N. (2006). On pure catalytic P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4135 LNCS, pp. 152–165). Springer Verlag. https://doi.org/10.1007/11839132_13
Mendeley helps you to discover research relevant for your work.