Dynamic P Systems

  • Rodica Ceterchi
  • Carlos Martín-Vide
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2597)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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–125CrossRefGoogle Scholar
  2. 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. 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
  4. 4.
    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, 1994MATHGoogle Scholar
  5. 5.
    R. Freund, M. Oswald: P systems with activated/prohibited membrane channels, paper presented at WMC 2002, Curtea de Argeş, RomaniaGoogle Scholar
  6. 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
  7. 7.
    C. Martín-Vide, G. Păun: Structured Contextual Grammars, Grammars, 1, 1 (1998), 33–55.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    A. Păun, G. Păun: The power of Communication: P Systems with Symport/Antiport, New Generation Computers, 20, 3(2002), 295–306MATHCrossRefGoogle Scholar
  9. 9.
    G. Păun: Marcus Contextual Grammars, Kluwer, Dordrecht, 1997MATHGoogle Scholar
  10. 10.
    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, 1998MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    G. Păun: Membrane Computing. An Introduction, Springer-Verlag, Berlin, Heidelberg, 2002Google Scholar
  12. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rodica Ceterchi
    • 1
  • Carlos Martín-Vide
    • 2
  1. 1.Faculty of MathematicsUniversity of BucharestBucharestRomania
  2. 2.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations