Abstract
We consider the result of a wet splicing procedure after the reaction has run to its completion, or limit, and we try to describe the molecules that will be present at this final stage. In language theoretic terms the splicing procedure is modeled as an H system, and the molecules that we want to consider correspond to a subset of the splicing language which we call the limit language. We give a number of examples, including one based on differential equations, and we propose a definition for the limit language. With this definition we prove that a language is regular if and only if it is the limit language of a reflexive and symmetric splicing system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Culik II, K., Harju, T.: Splicing Semigroups of Dominoes and DNA. Discrete Applied Mathematics 31, 261–277 (1991)
Freund, R., Csuhaj-Varjú, E., Wachtler, F.: Test Tube Systems with Cutting/Recombination Operations. In: Pacific Symposium on Biocomputing (1997), http://WWW-SMI.Stanford.EDU/people/altman/psb97/index.html
Goode, E., Pixton, D.: Recognizing Splicing Languages: Syntactic Monoids and Simultaneous Pumping (Submitted 2003)
Head, T., Păun, G., Pixton, D.: Generative Mechanisms Suggested by DNA Recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 7, vol. 2, pp. 295–360. Springer, Berlin (1997)
Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987), http://math.binghamton.edu/tom/index.html
Head, T.: Splicing Languages Generated with One Sided Context. In: Păun, G. (ed.) Computing with Bio-Molecules. Theory and Experiments, pp. 158–181. Springer, Heidelberg (1998)
Laun, E., Reddy, K.J.: Wet Splicing Systems. In: Wood, D.H. (ed.) Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, held at the University of Pennsylvania, June 23–25, pp. 115–126 (1997)
Pixton, D.: Splicing in Abstract Families of Languages. Theoretical Computer Science 234, 135–166 (2000)
Pixton, D.: Regularity of Splicing Languages. Discrete Applied Mathematics 69, 101–124 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Goode, E., Pixton, D. (2003). Splicing to the Limit. 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive