Abstract
P systems are computational models inspired by some biological features of the structure and the functioning of real cells. In this paper we introduce a new kind of communication between membranes, based upon the natural budding of vesicles in a cell. We define the operations of gemmation and fusion of mobile membranes, and we use membrane structures and rules over strings of biological inspiration only. We prove that P systems of this type can generate all recursively enumerable languages and, moreover, the Hamiltonian Path Problem can be solved in a quadratic time. Some open problems are also formulated.
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
L. Cardelli, A. G. Gordon, Mobile ambients, Proceedings of FoSSaCS’98 (M. Nivat, ed.), LNCS 1378, 140–155.
J. Castellanos, A. Rodriguez-Paton, Gh. Pąun, Computing with membranes: P systems with worm-objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64–74.
J. Dassow, Gh. Pąun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
M. R. Garey, D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979, W. H. Freeman and Company.
D. Hauschild, M. Jantzen, Petri nets algorithms in the theory of matrix grammars, Acta Informatica, 31 (1994), 719–728.
S. N. Krishna, R. Rama, P systems with replicated rewriting, J. Automata, Languages, Combinatorics, to appear.
Gh. Pąun, Computing with membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143 (see also Turku Center for Computer Science-TUCS Report No 208, 1998, http://www.tucs.fi).
Gh. Pąun, Computing with membranes — A variant: P systems with polarized membranes, Intern. J. of Foundations of Computer Science, 11, 1 (2000), 167–182.
Gh. Pąun, P systems with active membranes: Attacking NP complete problems, J. Automat, Languages and Combinatorics, 6, 1 (2001), 75–90.
Gh. Pąun, G. Rozenberg, A. Salomaa, Membrane computing with external output, Fundamenta Informaticae, 41, 3 (2000), 259–266, and Turku Center for Computer Science-TUCS Report No 218, 1998 (http://www.tucs.fi).
I. Petre, L. Petre, Mobile ambients and P systems, Workshop on Formal Languages, FCT99, Iaşi, 1999, J. Universal Computer Sci., 5, 9 (1999), 588–598 (see also Turku Center for Computer Science-TUCS Report No 293, 1999, http://www.tucs.fi).
J. E. Rothman, L. Orci, Budding vesicles in cells, March 1996, Scientific American.
G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Springer-Verlag, Heidelberg, 1997.
D. Voet, J. G. Voet, Biochemistry (second edition), 1995, John Wiley and Sons, Inc.
C. Zandron, C. Ferretti, G. Mauri, Solving NP-complete problems using P systems with active membranes, in vol. Unconventional Models of Computation (I. Antoniou, C. S. Calude, M. J. Dinneen, eds.), Springer-Verlag, London, 2000, 289–301.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besozzi, D., Zandron, C., Mauri, G., Sabadini, N. (2001). P Systems with Gemmation of Mobile Membranes. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive