Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Computation: finite and infinite machines
Computation: finite and infinite machines
On deterministic catalytic systems
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
The Expressiveness of Concentration Controlled P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
| Hi-index | 0.00 |
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.