Skip to main content
SpringerLink
Log in

The Power of Networks of Watson-Crick D0L Systems

  • Chapter
Aspects of Molecular Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2950))

Abstract

The notion of a network of Watson-Crick D0L systems was recently introduced, [7]. It is a distributed system of deterministic language defining devices making use of Watson-Crick complementarity. The research is continued in this paper, where we establish three results about the power of such networks. Two of them show how it is possible to solve in linear time two well-known NP-complete problems, the Hamiltonian Path Problem and the Satisfiability Problem. Here the characteristic feature of DNA computing, the massive parallelism, is used very strongly. As an illustration we use the propositional formula from the celebrated recent paper, [3]. The third one shows how in the very simple case of four-letter DNA alphabets we can obtain weird (not even Z-rational) patterns of population growth.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. Csima, J., Csuhaj-Varjú, E., Salomaa, A.: Power and size of extended Watson- Crick L systems. Theoretical Computer Science 290, 1665–1678 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Csuhaj-Varjú, E.: Networks of Language Processors. EATCS Bulletin 63, 120–134 (1997); Păun, G., Rozenberg, G., Salomaa, A. (eds.): Current Trends in Theoretical Computer Science, pp. 771–790. World Scientific, Singapore (2001)

    Google Scholar 

  6. Csuhaj-Varjú, E., Salomaa, A.: Networks of parallel language processors. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299–318. Springer, Heidelberg (1997)

    Google Scholar 

  7. Csuhaj-Varjú, E., Salomaa, A.: Networks of Watson-Crick D0L systems. TUCS Report 419, Turku Centre for Computer Science, Turku (2001); To appear in Ito, M., Imaoka, T. (eds.): Words, Languages, Combinatorics III. Proceedings of the Third International Colloquium in Kyoto, Japan. World Scientific Publishing Company, Singapore (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1986)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  13. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. I-III. Springer, Heidelberg (1997)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  15. Salomaa, A.: Computation and Automata. Cambridge University Press, Cambridge (1985)

    MATH  Google Scholar 

  16. Salomaa, A.: Watson-Crick walks and roads in D0L graphs. Acta Cybernetica 14, 179–192 (1999)

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Salomaa, A.: Iterated morphisms with complementarity on the DNA alphabet. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups, Transductions, pp. 405–420. World Scientific, Singapore (2001)

    Chapter  Google Scholar 

  19. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Text and Monographs in Computer Science. Springer, Heidelberg (1978)

    MATH  Google Scholar 

  20. Salomaa, A., Sosík, P.: Watson-Crick D0L systems: the power of one transition. Theoretical Computer Science 301, 187–200 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

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

    Arto Salomaa

Authors
  1. Erzsébet Csuhaj-Varjú
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of South Florida, 4202 E. Fowler Ave, 33620, Tampa, Fl, USA

    Nataša Jonoska

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Csuhaj-Varjú, E., Salomaa, A. (2003). The Power of Networks of Watson-Crick D0L Systems. 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_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation