Skip to main content
SpringerLink
Log in

Developmental Languages Versus DNA Computing

  • Chapter
Formal Languages and Applications

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 148))

  • 566 Accesses

Summary

The purpose of this paper is to discuss certain recent results concerning theoretical foundations of DNA computing. In particular, we are concerned with Watson-Crick D0L systems, presenting the theory within the general framework of Lindenmayer systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science, 266 (1994), 1021–1024.

    Article  Google Scholar 

  2. Braich, S., Chelyapov, N., Johnson, C., Rothemund, P., Adleman, L.: Solution of a 20-variable 3-SAT problem on a DNA computer. Sciencexpress,14 March 2002; 10.1126/science.1069528.

    Google Scholar 

  3. Amos, M., Pâun, Gh., Rozenberg, G., Salomaa, A.: DNA-based computing: a survey. Theoretical Computer Science, 287, 1 (2002), 3–38.

    Article  MathSciNet  MATH  Google Scholar 

  4. Csima, J., Csuhaj Varjú, E., Salomaa, A.: Power and size of extended Watson-Crick L systems, TUCS report 424, Turku Centre for Computer Science, Turku, 2001, to appear in Theoretical Computer Science.

    Google Scholar 

  5. Honkala, J.: The DOL problem revisited. EATCS Bulletin, 70 (2000), 142–147.

    MathSciNet  MATH  Google Scholar 

  6. Honkala, J., Salomaa, A.: Watson-Crick DOL systems with regular triggers. Theoretical Computer Science, 259 (2001), 689–698.

    Article  MathSciNet  MATH  Google Scholar 

  7. Karhumäki, J.: Two theorems concerning recognizable N-subsets of v’. Theoretical Computer Science, 1 (1976), 317–323.

    Article  MATH  Google Scholar 

  8. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. (Springer-Verlag, Berlin, Heidelberg, New York, 1986 ).

    Google Scholar 

  9. Mihalache, V., Salomaa, A.: Lindenmayer and DNA: Watson-Crick DOL systems. EATCS Bulletin, 62 (1997), 160–175.

    MATH  Google Scholar 

  10. Mihalache, V., Salomaa, A.: Language-theoretic aspects of DNA complementarity. Theoretical Computer Science, 250 (2001), 163–178.

    Article  MathSciNet  MATH  Google Scholar 

  11. Pâun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms (Springer-Verlag, Berlin, Heidelberg, New York, 1998 ).

    MATH  Google Scholar 

  12. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L systems (Academic Press, New York, London, 1980 ).

    MATH  Google Scholar 

  13. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 1–3 ( Springer-Verlag, Berlin, Heidelberg, New York, 1997 ).

    MATH  Google Scholar 

  14. Rozenberg, G., Salomaa, A.: DNA computing: new ideas and paradigms. Springer LNCS 1644 (1999), 106–118.

    MathSciNet  Google Scholar 

  15. Salomaa, A.: Formal Languages ( Academic Press, New York, 1973 ).

    MATH  Google Scholar 

  16. Salomaa, A.: Jewels of Formal Language Theory ( Computer Science Press, Rockville, Md., 1981 ).

    Google Scholar 

  17. Salomaa, A.: Turing, Watson-Crick and Lindenmayer. Aspects of DNA complementarity. In Unconventional Models of Computation ( C. Calude, J. Casti, M. Dinneen, Eds.) ( Springer-Verlag, Singapore, 1998 ), pp 94–107.

    Google Scholar 

  18. Salomaa, A.: Computability paradigms based on DNA complementarity. In V. Keränen, (Ed.) Innovation in Mathematics, Proc. 2nd Intern. Mathematics Symposium (Computational Mechanics Publications, Southampton, Boston, 1997 ), pp 15–28.

    Google Scholar 

  19. Salomaa, A.: Watson-Crick walks and roads on DOL graphs. Acta Cybernetica, 14 (1999), 179–192.

    MathSciNet  MATH  Google Scholar 

  20. Salomaa, A.: Uni-transitional Watson-Crick DOL systems. Theoretical Computer Science, 281 (2002), 537–553.

    Article  MathSciNet  MATH  Google Scholar 

  21. A. Salomaa, Iterated morphisms with complementarity on the DNA alphabet. In M. Ito, Gh. Päun, S. Yu (Eds.) Words, Semigroups, Transductions ( World Scientific Publ. Co., 2001 ), pp 405–420.

    Chapter  Google Scholar 

  22. Salomaa, A.: DNA complementarity and paradigms of computing. LNCS, 2387 (2002), 3–17.

    MathSciNet  Google Scholar 

  23. Salomaa, A, Soittola, M.: Automata-Theoretic Aspects of Formal Power Series (Springer-Verlag, Berlin, Heidelberg, New York, 1978 ).

    Google Scholar 

  24. Salomaa, A, Sosik, P.: Watson-Crick DOL systems: the power of one transition. TUCS report 439, Turku Centre for Computer Science, Turku, 2002. To appear in Theoretical Computer Science.

    Google Scholar 

  25. Sosík, P.: DOL Systems + Watson-Crick Complement = Universal Computation. LNCS, 2055 (2001), 308–320.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Turku Centre for Computer Science, Lemminkäisenkatu 14 A, FIN -20520, Turku, Finland

    Arto Salomaa

Authors
  1. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Lingustics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  3. Institute of Mathematics, Romanian Academy, PO Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Salomaa, A. (2004). Developmental Languages Versus DNA Computing. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39886-8_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53554-3

  • Online ISBN: 978-3-540-39886-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation