Iterated Morphisms with Complementarity on the DNA Alphabet
暂无分享,去创建一个
[1] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[2] Juha Honkala,et al. Watson-Crick D0L systems with regular triggers , 2001, Theor. Comput. Sci..
[3] Erzsébet Csuhaj-Varjú,et al. Networks of Watson-Crick D0L Systems , 2000, Words, Languages & Combinatorics.
[4] Juha Honkala. Easy cases of the D0L sequence equivalence problem , 2001, Discret. Appl. Math..
[5] Grzegorz Rozenberg,et al. TOL Schemes and Control Sets , 1975, Inf. Control..
[6] Peter C. Chapin. Formal languages I , 1973, CSC '73.
[7] Petr Sosík. Universal computation with Watson-Crick D0L systems , 2002, Theor. Comput. Sci..
[8] Arto Salomaa. Watson-Crick Walks and Roads on DOL Graphs , 1999, Acta Cybern..
[9] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[10] Arto Salomaa,et al. Lindenmayer and DNA: Watson-Crick D0L Systems , 1997, Bull. EATCS.
[11] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.
[12] Arto Salomaa. Uni-transitional Watson-Crick D0L systems , 2002, Theor. Comput. Sci..
[13] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[14] Arto Salomaa,et al. Language-theoretic aspects of DNA complematarity , 2001, Theor. Comput. Sci..