Upper Bounds for Restricted Splicing

  • Hendrik Jan Hoogeboom
  • Nikè van Vugt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)


We determine or improve upper bounds for non-iterated splicing in length-increasing, length-decreasing, same-length and self splicing mode.


Turing Machine Regular Language Input String Splice System State Transduction 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CH91]
    K. Culik II, T. Harju. Splicing Semigroups of Dominoes and DNA, Discrete Applied Mathematics, 31:162–177, 1991.CrossRefMathSciNetGoogle Scholar
  2. [DHvV00]
    R. Dassen, H.J. Hoogeboom, N. van Vugt. A Characterization of Noniterated Splicing with Regular Rules. In: Where Mathematics, Computer Science and Biology Meet (C. Martin-Vide, V. Mitrana, Eds.), Kluwer Academic Publishers, 2000, pages 319–327.Google Scholar
  3. [EY71]
    R.W. Ehrich, S.S. Yau. Two-Way Sequential Transductions and Stack Automata. Information and Control 18:404–446, 1971.CrossRefMathSciNetzbMATHGoogle Scholar
  4. [FS97]
    H. Fernau and R. Stiebe. Regulation by Valences. In: B. Rovan (Ed.) Proceedings of MFCS’97, Lecture Notes in Computer Science, vol. 1295, pages 239–248. Springer-Verlag, 1997.Google Scholar
  5. [FS00]
    H. Fernau, R. Stiebe. Sequential Grammars and Automata with Valences. Technical Report WSI-2000-25, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 2000. Submitted. Available via
  6. [Gre78]
    S.A. Greibach. Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theoretical Computer Science 7 (1978) 311–324.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [HPP97]
    T. Head, Gh. Păun, D. Pixton. Language Theory and Molecular Genetics: Generative Mechanisms Suggested by DNA Recombination. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, Eds.), volume 2, Springer-Verlag, 1997.Google Scholar
  8. [HU79]
    J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.Google Scholar
  9. [HvV98]
    H.J. Hoogeboom, N. van Vugt. The Power of H Systems: Does Representation Matter? Computing with Bio-molecules: Theory and Experiments (G. Păun, Ed.), Springer-Verlag, Singapore, 255–268, 1998.Google Scholar
  10. [KPS96]
    L. Kari, G. Păun, A. Salomaa. The Power of Restricted Splicing with Rules from a Regular Language, Journal of Universal Computer Science, 2(4):224–240, 1996.zbMATHMathSciNetGoogle Scholar
  11. [LLR85]
    M. Latteux, B. Leguy, B. Ratoandromanana. The Family of One-Counter Languages Is Closed under Quotient, Acta Informatica 22:579–588, 1985.zbMATHMathSciNetGoogle Scholar
  12. [Pău80]
    G. Păun. A New Generative Device: Valence Grammars. Revue Roumaine de Mathématiques Pures et Appliquées 6 (1980) 911–924.Google Scholar
  13. [PRS95]
    Gh. Păun, G. Rozenberg, A. Salomaa. Computing by Splicing, Theoretical Computer Science 168:321–336, 1996.CrossRefMathSciNetzbMATHGoogle Scholar
  14. [PRS96]
    Gh. Păun, G. Rozenberg, A. Salomaa. Restricted Use of the Splicing Operation, International Journal of Computer Mathematics 60:17–32, 1996.zbMATHCrossRefGoogle Scholar
  15. [PRS98]
    Gh. Păun, G. Rozenberg, A. Salomaa. DNA Computing. New Computing Paradigms, Springer-Verlag, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hendrik Jan Hoogeboom
    • 1
  • Nikè van Vugt
    • 1
  1. 1.Institute of Advanced Computer ScienceUniversiteit LeidenLeidenThe Netherlands

Personalised recommendations