Abstract
A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
