Abstract
D0L systems consist of iterated letter-to-string morphism over a finite alphabet. Their descriptional power is rather limited and their length sequences can be expressed as sum of products of polynomial and exponential functions. There were several attempts to enrich their structure by various types of regulation, see e.g. [1], leading to more powerful mechanisms.
Due to increasing interest in biocomputing models, V. Mihalache and A. Salomaa suggested in 1997 Watson-Crick D0L systems with so called Watson-Crick morphism. This letter-to-letter morphism maps a letter to the complementary letter, similarly as a nucleotide is joined with the complementary one during transfer of genetic information. Moreover, this new morphism is triggered by a simple condition (called trigger), e.g. with majority of pyrimidines over purines in a string.
This paper deals with the expressive power of standard Watson-Crick D0L systems. A rather unexpected result is obtained: any Turing computable function can be computed by a Watson-Crick D0L system.
Acknowledgements
I am grateful to Arto Salomaa for inspiration, useful remarks and discussions about this paper, to Erzsebet Csuhaj-Varjú and Rudi Freund for invitation to their institutes, and to Alica Kelemenová and Jozef Kelemen for continuous support. Research was supported by the Grant Agency of Czech Republic, grants No. 201/98/P047 and 201/99/1086.
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
J. Dassow, G. Păun, Regulated Rewriting in Formal Language Theory (Springer-Verlag, Berlin, 1989).
J. Gruska, Foundations of Computing (International Thomson Computer Press, London, 1997).
S. Kleene, General recursive functions on natural numbers, Mathematische Annalen 112 (1936) 727–742.
V. Mihalache, A. Salomaa, Language-Theoretic Aspects of DNA Complementarity, Theoretical Computer Science 250 (2001) 163–178.
V. Mihalache, A. Salomaa, Lindenmayer and DNA: Watson-Crick D0L systems. EATCS Bulletin 62 (1997) 160–175.
G. Păun, G. Rozenberg, A. Salomaa, DNA Computing.New Computing Paradigms (Springer-Verlag, Berlin, 1998).
G. Rozenberg, A. Salomaa, The Mathematical Theory of L systems (Academic Press, New York, 1980).
A. Salomaa, Turing, Watson-Crick and Lindenmayer. Aspects of DNA complementarity, in C.S. Calude, J. Casti, M.J. Dinneen, eds., Unconventional Models of Computation (Springer-Verlag, Berlin, 1998) 94–107.
A. Salomaa, Watson-Crick walks and roads in D0L graphs, Acta Cybernetica 14 (1999) 179–192.
A. Salomaa, G. Rozenberg, eds., Handbook of Formal Languages (Springer-Verlag, Berlin, 1997).
C. H. Smith, A Recursive Introduction to the Theory of Computation (Springer-Verlag, Berlin, 1994).
P. SosÃk, Universal Computation with Watson-Crick D0L Systems, Silesian University, Institute of Computer Science tech. report 2000/1.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
SosÃk, P. (2001). D0L System + Watson-Crick Complementarity = Universal Computation. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-45132-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42121-4
Online ISBN: 978-3-540-45132-7
eBook Packages: Springer Book Archive