%0 Journal Article
	%A Kazuki Murakami and  Takashige Nakamura and  Noriko Sakamoto and  Kunio Aizawa
	%D 2010
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 40, 2010
	%T Some Relationships between Classes of Reverse Watson-Crick Finite Automata
	%U https://publications.waset.org/pdf/3446
	%V 40
	%X A Watson-Crick automaton is recently introduced as a
computational model of DNA computing framework. It works on
tapes consisting of double stranded sequences of symbols. Symbols
placed on the corresponding cells of the double-stranded sequences are
related by a complimentary relation. In this paper, we investigate a
variation of Watson-Crick automata in which both heads read the tape
in reverse directions. They are called reverse Watson-Crick finite
automata (RWKFA). We show that all of following four classes, i.e.,
simple, 1-limited, all-final, all-final and simple, are equal to
non-restricted version of RWKFA.
	%P 446 - 449