Dynamic P Systems
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.
Unable to display preview. Download preview PDF.
- 2.G. Bel-Enguix, M. Cavaliere, R. Ceterchi, R. Gramatovici, C. Martín-Vide: An Application of Dynamic P Systems: Generating Context-Free Languages, this volumeGoogle Scholar
- 3.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–144Google Scholar
- 5.R. Freund, M. Oswald: P systems with activated/prohibited membrane channels, paper presented at WMC 2002, Curtea de Argeş, RomaniaGoogle Scholar
- 6.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–62Google Scholar
- 11.G. Păun: Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002Google Scholar
- 12.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–164Google Scholar