Abstract
The mathematical theory of DNA computing presented in Part II of this book is developed in the framework of formal language theory. As we have seen in Chap. 1, DNA molecules have a natural representation through “double” strings satisfying certain assumptions (Watson-Crick complementarity and opposite directionality). Also, various enzymatic operations on DNA molecules can be naturally represented as operations on (double) strings. Consequently, using DNA molecules and their manipulation for the purpose of DNA computing can be conveniently and naturally expressed in the framework of (double) strings and operations on them. This leads to formal language theory as a natural framework for formalizing and investigating DNA computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Păun, G., Rozenberg, G., Salomaa, A. (1998). Introduction to Formal Language Theory. In: DNA Computing. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03563-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-03563-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08388-4
Online ISBN: 978-3-662-03563-4
eBook Packages: Springer Book Archive