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.
Highlights
The tremendous progress in biotechnology has resulted in decoding of DNA sequences, synthesizing and manipulating DNA, which lead to its usage in computation by computer scientists
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
In Example 1 we have shown that two-way non-deterministic Watson-Crick automata. NWK (AWK) can accept the mirror language and in theorem 7 we have shown that AWK 2AWK i.e. 2AWK accepts all the family of languages which are accepted by AWK
Summary
The tremendous progress in biotechnology has resulted in decoding of DNA sequences, synthesizing and manipulating DNA, which lead to its usage in computation by computer scientists. The effect of the complementarity relation on the computing power of Watson Crick automata is discussed in [10]. A twoway Watson Crick automaton (2AWK) is similar in concept to a two-way finite automaton. The only difference between them is that in two-way Watson Crick automata the input tape is double stranded. The idea of two-way Watson Crick automata were introduced in [4] but no comparison of its power with respect to AWK was discussed. We give a general description of non-deterministic Watson Crick automata and its different subclasses in Sections 2 and 3. We state the rules governing two-way non-deterministic Watson Crick automata.
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
