L. M. Adleman, “Molecular Computation of Solutions to Combinatorial Problems,” Science, New Series, Vol. 226, No. 5187, 1994, pp. 1021-1024. http://dx.doi.org/10.1126/science.7973651
has been cited by the following article:
TITLE: Equivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata
AUTHORS: Kumar Sankar Ray, Kingshuk Chatterjee, Debayan Ganguly
KEYWORDS: Non-Deterministic Watson Crick Automata; Two-Way Non-Deterministic Watson Crick Automata; RE Languages
JOURNAL NAME: Applied Mathematics, Vol.4 No.10A, September 30, 2013
ABSTRACT: Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick automata which are more powerful than non-deterministic Watson Crick automata. We also establish the equivalence of different subclasses of two-way Watson crick automata. We further show that recursively enumerable (RE) languages can be realized by an image of generalized sequential machine (gsm) mapping of two-way Watson-Crick automata.