DNA Computing pp 355-379 | Cite as

Splicing Revisited

  • Gheorghe Păun
  • Grzegorz Rozenberg
  • Arto Salomaa
Part of the Texts in Theoretical Computer Science book series (TTCS)


Besides the variants of the splicing operation discussed in the previous chapters (especially in Chap. 8) and of the generative mechanisms based on them, several others were already investigated in the literature, mainly from a mathematical point of view, without directing the research toward (universal) computability models. In this chapter we present some of these variants, as a challenge to the reader for building further computability models.


Growth Function Regular Language Replication System Bibliographical Note Chomsky Hierarchy 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Gheorghe Păun
    • 1
    • 2
  • Grzegorz Rozenberg
    • 3
  • Arto Salomaa
    • 4
  1. 1.Institute of Mathematics of Romanian AcademyBucharestRomania
  2. 2.Research Group on Natural Computing, Department of Computer Science and Artificial IntelligenceSevilla UniversitySevillaSpain
  3. 3.Leiden Institute of Advanced Computer ScienceUniversity of LeidenLeidenThe Netherlands
  4. 4.Turku Centre of Computer ScienceTurkuFinland

Personalised recommendations