References

  1. Leonard M. Adleman (1994): Molecular computation of solutions to combinatorial problems. Science 226, pp. 1021–1024, doi:10.1126/science.7973651.
  2. Elena Czeizler & Eugen Czeizler (2006): A Short Survey on Watson-Crick Automata. Bulletin of the EATCS 88, pp. 104–119.
  3. Rudolf Freund, Gheorghe Păun, Grzegorz Rozenberg & Arto Salomaa (1997): Watson-Crick finite automata. In: 3rd DIMACS Sympozium On DNA Based Computers, Philadelphia, pp. 305–317, doi:10.1090/dimacs/048/22.
  4. Dietrich Kuske & Peter Weigel (2004): The role of the complementarity relation in Watson-Crick automata and sticker systems. In: Developments in Language Theory, DLT 2004, Lecture Notes in Computer Science, LNCS 3340. Springer, Berlin, Heidelberg, pp. 272–283, doi:10.1007/978-3-540-30550-7_23.
  5. Peter Leupold & Benedek Nagy (2010): 5' →3' Watson-Crick automata with several runs. Fundamenta Informaticae 104, pp. 71–91, doi:10.3233/FI-2010-336.
  6. Benedek Nagy (2008): On 5' →3' sensing Watson-Crick finite automata. In: Garzon M.H., Yan H. (eds): DNA Computing. DNA 2007: Selected revised papers, Lecture Notes in Computer Science, LNCS 4848. Springer, Berlin, Heidelberg, pp. 256–262, doi:10.1007/978-3-540-77962-9_27.
  7. Benedek Nagy (2009): On a hierarchy of 5' →3' sensing WK finite automata languages. In: Computaility in Europe, CiE 2009: Mathematical Theory and Computational Practice, Abstract Booklet, Heidelberg, pp. 266–275.
  8. Benedek Nagy (2010): 5' 3' Sensing Watson-Crick Finite Automata, pp. 39–56, In: Gabriel Fung (ed.): Sequence and Genome Analysis II –- Methods and Applications. iConcept Press.
  9. Benedek Nagy (2013): On a hierarchy of 5' →3' sensing Watson-Crick finite automata languages. Journal of Logic and Computation 23(4), pp. 855–872, doi:10.1093/logcom/exr049.
  10. Gheorghe Păun (1997): Marcus Contextual Grammars. Studies in Linguistics and Philosophy Volume 67. Kluwer, Dordrecht, doi:10.1007/978-94-015-8969-7_2.
  11. Gheorghe Păun, Grzegorz Rozenberg & Arto Salomaa (2002): DNA Computing: New Computing Paradigms. Springer-Verlag, doi:10.1007/978-3-662-03563-4.
  12. Grzegorz Rozenberg & Arto Salomaa (1997): Handbook of Formal Languages. Springer.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org