Skip to main content

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

  • Conference paper
Book cover Membrane Computing (WMC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2933))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Chapter  Google Scholar 

  2. Păun, G.: Regular extended H systems are computationally universal. JALC 1(1), 27–36 (1996)

    MATH  Google Scholar 

  3. Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000); and TUCS Report 208 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Păun, G.: DNA computing based on splicing: Universality results. Theoretical Computer Science 231(N2), 275–296 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  6. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  7. Verlan, S., Margenstern, M.: About splicing P systems with one membrane (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Verlan, S. (2004). About Splicing P Systems with Immediate Communication and Non-extended Splicing P Systems. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2003. Lecture Notes in Computer Science, vol 2933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24619-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24619-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20895-2

  • Online ISBN: 978-3-540-24619-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics