Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems

  • Franziska Freund
  • Rudolf Freund
  • Marion Oswald
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2950)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 226, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 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)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Dassow, J., Păun, G.: On the power of membrane computing. Journal of Universal Computer Science 5(2), 33–49 (1999), MathSciNetGoogle Scholar
  4. 4.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Heidelberg (1989)Google Scholar
  5. 5.
    Freund, R.: Generalized P-systems. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 281–292. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 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. 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. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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. 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)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Păun, G.: Computing with membranes. Journal of Computer and System Sciences  61(1), 108–143 (2000); TUCS Research Report 208 (1998), Google Scholar
  12. 12.
    Păun, G.: Computing with Membranes: an Introduction. Bulletin EATCS 67, 139–152 (1999)zbMATHGoogle Scholar
  13. 13.
    Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)zbMATHGoogle Scholar
  14. 14.
    Păun, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics 1(1), 27–37 (1996)zbMATHMathSciNetGoogle Scholar
  15. 15.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)zbMATHGoogle Scholar
  16. 16.
    Pixton, D.: Splicing in abstract families of languages. Theoretical Computer Science 234, 135–166 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  18. 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. 19.
    The P Systems Web Page,

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Franziska Freund
    • 1
  • Rudolf Freund
    • 2
  • Marion Oswald
    • 2
  1. 1.Gymnasium der Schulbrüder, StrebersdorfWienAustria
  2. 2.Department of Computer ScienceTechnical University WienWienAustria

Personalised recommendations