Advertisement

About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems

  • Sergey Verlan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)

Abstract

We consider splicing P systems with immediate communication introduced by Gh. Păun in [5]. We solve the open problem Q17 from that book by proving that systems with two membranes can generate any recursively enumerable language. We discuss the similarities between splicing P systems with immediate communication having two membranes and time-varying distributed H systems with two components. We also consider non-extended splicing P systems, i.e., without a terminal alphabet. We show that it is possible to generate any recursively enumerable language by such systems with two membranes. In this way we solve the open problem Q16 from the same book.

Keywords

Evolution Rule Elementary Membrane Formal Grammar Membrane Computing Skin Membrane 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Margenstern, M., Rogozhin, Y., Verlan, S.: Time-varying distributed H systems of degree 2 can carry out parallel computations. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 326–336. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Păun, G.: Regular extended H systems are computationally universal. JALC 1(1), 27–36 (1996)zbMATHGoogle Scholar
  3. 3.
    Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000); and TUCS Report 208 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Păun, G.: DNA computing based on splicing: Universality results. Theoretical Computer Science 231(N2), 275–296 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)zbMATHGoogle Scholar
  6. 6.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  7. 7.
    Verlan, S., Margenstern, M.: About splicing P systems with one membrane (in preparation)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Sergey Verlan
    • 1
  1. 1.Laboratoire d’Informatique Théorique et AppliquéeUniversité de MetzFrance

Personalised recommendations