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.

中文翻译：

---

沃森-克里克跳跃有限自动机

Watson-Crick 跳跃有限自动机在磁带上工作，这些磁带是类似于 Watson-Crick 自动机的双链符号序列。以不连续方式扫描双链序列。也就是说，在读取一个双链字符串后，自动机可以跳过一些子序列并根据规则继续扫描。这种自动机的一些变体是 1-limited、No state、All final 和 Simple Watson-Crick jumping 有限自动机。已经将这些变体接受的语言与乔姆斯基层次结构中的语言类进行了比较。我们研究了一些闭包属性。我们还尝试将单词的重复闭包放在 Watson-Crick 跳跃有限自动机族中。我们已经讨论了 Watson-Crick 跳跃有限自动机族在重复操作下的闭包性质。