Abstract
We propose in this paper a uniform manner of generating families of P systems, using contextual grammars, specifically, variants of bracketed contextual grammars. We introduce the concept of enriched bracketed contextual grammar, which can be used to generate families of P systems with symport/antiport rules.
More generally, we define the notion of dynamic P system associated to grammars able to “generate” families of P systems, and introduce the notion of dynamic computation sequence, which combines the previous generative approach with computational aspects.
We illustrate these notions with an application to the problem of sorting. The model of sorting we propose uses symport/antiport rules with priority relations, and the notion of stable configuration of a P system.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Work supported by the grant SAB2000-0145, the Secretaría de Estado de Educación y Universidades, Spanish Ministry for Education, Culture and Sport.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. J. Arulanandham: Implementing Bead-Sort with P Systems, in Unconventional Models of Computation 2002 (C. S. Calude, M. J. Dineen, F. Peper, eds.), Lecture Notes in Computer Science, 2509, Springer-Verlag, Heidelberg, 2002, 115–125
G. Bel-Enguix, M. Cavaliere, R. Ceterchi, R. Gramatovici, C. Martín-Vide: An Application of Dynamic P Systems: Generating Context-Free Languages, this volume
R. Ceterchi, C. Martín-Vide: Generating P Systems with Contextual Grammars, Pre-proceedings of the Workshop on Membrane Computing, Curtea de Argeş, 2002, 119–144
E. Csuhaj-Varjú, J. Dassow, J. Kelemen, G. Păun: Grammar Systems: A Grammatical Approach to Distribution and Cooperation, Gordon and Breach Science Publ., London, 1994
R. Freund, M. Oswald: P systems with activated/prohibited membrane channels, paper presented at WMC 2002, Curtea de Argeş, Romania
M. Margenstern, C. Martín-Vide, G. Păun: Computing with Membranes: Variants with Enhanced Membrane Handling, Proceedings of 7th Intern. Meeting on DNA Based Computers (N. Jonoska, N. C. Seeman, eds.), Tampa, Florida, USA, 2001, 53–62
C. Martín-Vide, G. Păun: Structured Contextual Grammars, Grammars, 1, 1 (1998), 33–55.
A. Păun, G. Păun: The power of Communication: P Systems with Symport/Antiport, New Generation Computers, 20, 3(2002), 295–306
G. Păun: Marcus Contextual Grammars, Kluwer, Dordrecht, 1997
G. Păun: Computing with Membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108–143, and Turku Center for CS-TUCS Report No. 208, 1998
G. Păun: Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002
C. Zandron, C. Ferretti, G. Mauri: Two Normal Forms for Rewriting P Systems, Proc. Third. Intern. Conf. on Universal Machines and Computations, Chişinău, Moldova, 2001 (M. Margenstern, Y. Rogozhin, eds.), Lecture Notes in Computer Science, 2055, Springer, 2001, 153–164
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ceterchi, R., Martín-Vide, C. (2003). Dynamic P Systems. In: PĂun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. WMC 2002. Lecture Notes in Computer Science, vol 2597. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36490-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-36490-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00611-4
Online ISBN: 978-3-540-36490-0
eBook Packages: Springer Book Archive