Abstract
ABSTRACTInspired by multi-head finite automata and Watson–Crick automata, in this paper, we introduce a new structure, namely multi-head Watson–Crick automata, where we replace the single tape of a multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to the Watson–Crick complementarity relation. We establish the superiority of our model over multi-head finite automata and also show that both the deterministic and non-deterministic variants of the model can accept non-regular unary languages. We also compare our model with parallel communicating Watson–Crick automata systems and prove that both of them have the same computational power.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
