DNA computing: New ideas and paradigms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 106-118

  Rozenberg, Grzegorz ^a,b   Salomaa, Arto ^c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UCB 450   (United States)

^c TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS;

DNA COMPUTATION; DNA MOLECULES; DNA-COMPUTING; THEORETICAL POINTS; TURING UNIVERSALITY;

DNA;

EID: 22644450278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_9     Document Type: Conference Paper

References (10)

1. L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science 226 1021 - 1024.
2. J. Engelfriet, G. Rozenberg, Fixed point languages, equality languages, and re-presentations of recursively enumerable languages, J., Assoc. Comput. Mach. 27 (1980) 499 - 518.
3. R. J. Lipton, E. B. Baum, eds., DNA Based Computers, Proc. of the DIMACS Workshop, Princeton, 1995, Amer. Math. Soc., 1996.
4. V. Mihalache, A. Salomaa, Language-theoretic aspects of DNA complementarity, Theoret. Comput. Sci., to appear.
5. G. Paun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, Heidelberg, 1998.
6. G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New-York, 1980.
7. A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockville, Md., 1981.
8. A. Salomaa, Watson-Crick walks and roads in D0L graphs, Acta Cybernetica, to appear.
9. B. A. Trakhtenbrot, A survey of Russian approaches to perebor algorithms, Ann. Hist. Comput. 6 (1984) 384 - 400.
10. B. A. Trakhtenbrot, From logic to theoretical computer science, in C. Calude, ed., People and Ideas in Theoretical Computer Science, Springer-Verlag, Berlin, 1999, 314 - 341.