Skip to main content

Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems

  • Chapter
Aspects of Molecular Computing

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

Abstract

We consider a variant of test tube systems communicating by applying splicing rules, yet without allowing operations in the tubes themselves. These test tube systems communicating by applying splicing rules of some restricted type are shown to be equivalent to a variant of splicing test tube systems using a corresponding restricted type of splicing rules. Both variants of test tube systems using splicing rules are proved to be equivalent to membrane systems with splicing rules assigned to membranes, too. In all the systems considered in this paper, for the application of rules leading from one configuration to the succeeding configuration we use a sequential model, where only one splicing rule is applied in one step; moreover, all these systems have universal computational power.

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. Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 226, 1021–1024 (1994)

    Article  Google Scholar 

  2. Csuhaj-Varjú, E., Kari, L., Păun, G.: Test tube distributed systems based on splicing. Computers and Artificial Intelligence 15(2), 211–232 (1996)

    MATH  MathSciNet  Google Scholar 

  3. Dassow, J., Păun, G.: On the power of membrane computing. Journal of Universal Computer Science 5(2), 33–49 (1999), http://www.iicm.edu/jucs

    MathSciNet  Google Scholar 

  4. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)

    Google Scholar 

  5. Freund, R.: Generalized P-systems. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 281–292. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Freund, F., Freund, R.: Molecular computing with generalized homogenous Psystems. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 130–144. Springer, Heidelberg (2001)

    Google Scholar 

  7. Freund, F., Freund, R.: Test tube systems: When two tubes are enough. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory, Foundations, Applications and Perspectives, pp. 338–350. World Scientific Publishing Co., Singapore (2000)

    Google Scholar 

  8. Freund, R., Kari, L., Păun, G.: DNA computing based on splicing: the existence of universal computers. Theory of Computing Systems 32, 69–112 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Freund, F., Freund, R., Margenstern, M., Oswald, M., Rogozhin, Y., Verlan, S.: P systems with cutting/recombination rules or splicing rules assigned to membranes. In: Alhazov, A., Martín-Vide, C. (eds.) Pre-Proceedings of the Workshop on Membrane Computing, WMC-2003, Tarragona, July 17-22, pp. 241–251 (2003)

    Google Scholar 

  10. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biology 49, 737–759 (1987)

    MATH  MathSciNet  Google Scholar 

  11. Păun, G.: Computing with membranes. Journal of Computer and System Sciences  61(1), 108–143 (2000); TUCS Research Report 208 (1998), http://www.tucs.fi

    Google Scholar 

  12. Păun, G.: Computing with Membranes: an Introduction. Bulletin EATCS 67, 139–152 (1999)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  14. Păun, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics 1(1), 27–37 (1996)

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  16. Pixton, D.: Splicing in abstract families of languages. Theoretical Computer Science 234, 135–166 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  18. Verlan, S.: About splicing P systems with immediate communication and nonextended splicing P systems. In: Alhazov, A., Martín-Vide, C., Păun, G. (eds.) Pre-Proceedings of the Workshop on Membrane Computing, WMC-2003, Tarragona, July 17-22, pp. 461–473 (2003)

    Google Scholar 

  19. The P Systems Web Page, http://psystems.disco.unimib.it

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Freund, F., Freund, R., Oswald, M. (2003). Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics