Abstract
Membrane systems (P systems) are computational models of processes which take place in living cells. Here we investigate the power of the original version of P systems introduced in Păun (1998), called simple P systems in Păun (2002). On one hand, we show that P systems with catalysts, without any other additional feature, are computationally universal. This rather surprising result improves some previous universality theorems of P systems, including the fundamental ``computational completeness lemma for P systems'' Păun (1998), and solves the open problem Q1 in Păun (2002). On the other hand, we show that the power of P systems with priorities but without interactions (open problem Q2) does not exceed the power of ET0L systems with random context regulation without appearance checking.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Calude, C.S. and Gh. Păun. Computing with Cells and Atoms, Taylor & Francis, London, 2001.
Dassow, J. and Gh. Păun. Regulated Rewriting in Formal Language Theory, Springer, Berlin, 1989.
Dassow, J. and Gh. Păun. On the power of membrane computing, Journal of Universal Computer Science 5(2): 33-49, 1999. (http://www.iicm.edu/jucs)
Freund, R. and M. Oswald. GP systems with forbidding context, Fundamenta Informaticae 49(1-3): 81-102, 2002.
Head, T. Aqueous simulations of membrane computations, Romanian Journal of Information Science and Technology 5(4), 2002, to appear.
Minsky, M.L. Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, NJ, 1967.
Păun, Gh. Computing with membranes: an introduction, Bulletin EATCS 67: 139-152, 1999.
Păun, Gh. Computing with membranes, Journal of Computer and System Sciences 61(1): 108-143, 2000 and TUCS Research Report 208, 1998 (http://www.tucs.fi).
Păun Gh. Membrane Computing: An Introduction, Springer, Berlin, 2002.
Păun, Gh. and S. Yu, On synchronization in P systems, Fundamenta Informaticae 38(4): 397-410, 1999.
Salomaa, A. and G. Rozenberg (eds.). Handbook of Formal Languages, Springer, Berlin, 1997.
Sosík, P. and R. Freund, P systems without priorities are computationally universal. In Păun, Gh. et. al., Membrane Computing 2002, Lecture Notes in Computer Science, Springer, Berlin, 2002, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
SosÍk, P. The Power of Catalysts and Priorities in Membrane Systems. Grammars 6, 13–24 (2003). https://doi.org/10.1023/A:1024057002599
Issue Date:
DOI: https://doi.org/10.1023/A:1024057002599