@article{(Open Science Index):https://publications.waset.org/pdf/3446,
	  title     = {Some Relationships between Classes of Reverse Watson-Crick Finite Automata},
	  author    = {Kazuki Murakami and  Takashige Nakamura and  Noriko Sakamoto and  Kunio Aizawa},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {4},
	  number    = {4},
	  year      = {2010},
	  pages     = {446 - 449},
	  ee        = {https://publications.waset.org/pdf/3446},
	  url   	= {https://publications.waset.org/vol/40},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 40, 2010},
	}