DNA Complementarity and Paradigms of Computing

[1]  Arto Salomaa,et al.  Watson-crick D0l Systems , 1997 .

[2]  Erzsébet Csuhaj-Varjú,et al.  Power and size of extended Watson-Crick L systems , 2003, Theor. Comput. Sci..

[3]  Gheorghe Paun,et al.  Topics in the theory of DNA computing , 2002, Theor. Comput. Sci..

[4]  Arto Salomaa.  Uni-transitional Watson-Crick D0L systems , 2002, Theor. Comput. Sci..

[5]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[6]  John L. Casti,et al.  Unconventional Models of Computation , 2002, Lecture Notes in Computer Science.

[7]  Juha Honkala,et al.  Watson-Crick D0L systems with regular triggers , 2001, Theor. Comput. Sci..

[8]  Petr Sosík.  D0L System + Watson-Crick Complementarity = Universal Computation , 2001, MCU.

[9]  Arto Salomaa.  Iterated Morphisms with Complementarity on the DNA Alphabet , 2001, Words, Semigroups, and Transductions.

[10]  Arto Salomaa,et al.  Language-theoretic aspects of DNA complematarity , 2001, Theor. Comput. Sci..

[11]  Grzegorz Rozenberg,et al.  DNA Computing: New Ideas and Paradigms , 1999, ICALP.

[12]  Erik Winfree,et al.  On applying molecular computation to the data encryption standard , 1999, DNA Based Computers.

[13]  Arto Salomaa.  Watson-Crick Walks and Roads on DOL Graphs , 1999, Acta Cybern..

[14]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[15]  A. Salomaa.  Turing, Watson-Crick and Lindenmayer. Aspects of DNA Complementarity , 1997 .

[16]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 1: word, language, grammar , 1997 .

[17]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[18]  Rudolf Freund,et al.  Watson-Crick finite automata , 1997, DNA Based Computers.

[19]  Richard J. Lipton,et al.  DNA Based Computers , 1996 .

[20]  D K Gifford,et al.  On the path to computation with DNA. , 1994, Science.

[21]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[22]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[23]  A. Salomaa.  Jewels of formal language theory , 1981 .

[24]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[25]  Arto Salomaa.  Computability Paradigms Based OnDNA Complementarity , 1970 .

[26]  Paul R. Halmos.  Innovation in Mathematics , 1958 .