On Pure Catalytic P Systems
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 ,,,,. 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 . 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.
KeywordsCatalytic System Register Machine Membrane Computing Applicable Rule Formal Language Theory
Unable to display preview. Download preview PDF.
- 1.Dassow, J., Păun, Gh.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
- 2.Dassow J.: Grammars with Regulated Rewriting, Handout given during the Ph.D school at Terragona (2003), theo.cs.uni-magdeburg.de/dassow/tarraphd.pdf
- 4.Freund, R., Oswald, M., Sosik, P.: Reducing the number of catalysts required in computationally universal systems without priorities. In: Proceedings of DCFS 2003, pp. 102–113 (2003)Google Scholar
- 8.Krishna, S.N.: On Pure Catalytic P Systems. Technical Report, IIT Bombay (2006), www.cse.iitb.ac.in/~krishnas/uc06.ps
- 10.Papadimitriou, C.: Computational Complexity, 1st edn. Addison-Wesley, Reading (1993)Google Scholar
- 12.Păun, Gh.: 2006 Research Topics in Membrane Computing (manuscript, 2006)Google Scholar