Abstract
We improve some results concerning the size of P systems with gemmation of mobile membranes. We show that systems with meta-priority relations and without (in/out) communication rules generate any recursively enumerable language with three membranes, thus we present an optimal result on the necessary number of membranes to obtain computational completeness. In the case of gemmating P systems with only pre-dynamical rules, we prove that four membranes are sufficient to generate any recursively enumerable language.
Research supported in part by the Hungarian Scientific Research Fund “OTKA” Grants No. T 042529 and F 037567 and the project “MolCoNet” IST-2001-32008.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Besozzi, D., Csuhaj-Varjú, E., Mauri, G., Zandron, C.: Size and power of extending gemmating P systems. In: Păun, G., Riscos-Núnez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proc. Second Brainstorming Week on Membrane Computing, Sevilla, 2-7 February 2004, TR 01/2004, Research Group on Natural Computing, University of Sevilla, pp. 92–101 (2004)
Besozzi, D., Mauri, G., Păun, G., Zandron, C.: Gemmating P systems: collapsing hierarchies. Theoretical Computer Science 296(2), 253–267 (2003)
Besozzi, D., Zandron, C., Mauri, G., Sabadini, N.: P systems with gemmation of mobile membranes. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 136–153. Springer, Heidelberg (2001)
Freund, R., Păun, A., Oswald, M.: Gemmating P systems are computationally complete with four membranes. In: Ilie, L., Wotschke, D. (eds.) Descriptional Complexity of Formal Systems, London, Canada, 26-28 July, 2004, pp. 191–203. Department of Computer Science, University of Western Ontario, Report no. 619 (2004)
Geffert, V.: Context-free-like forms for the phrase structure grammars. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol. 324, pp. 309–317. Springer, Heidelberg (1988)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000) (See also as Turku Center for Computer Science Report no. 208 (1998), www.tucs.fi)
Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Rothman, J.E., Orci, L.: Budding vesicles in cells. Scientific American 274(3), 70–75 (1996)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Voet, D., Voet, J.G.: Biochemistry. John Wiley and Sons Inc., Chichester (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Csuhaj-Varjú, E., Vaszil, G. (2005). Reducing the Size of Extended Gemmating P Systems. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-31837-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25080-7
Online ISBN: 978-3-540-31837-8
eBook Packages: Computer ScienceComputer Science (R0)