Watson-Crick Jumping Finite Automata

Watson-Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson-Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson-Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson-Crick jumping finite automata family. We have discussed the closure property of Watson-Crick jumping finite automata family under duplication operations.