Watson–Crick (abbreviated as WK) finite automata are working on double stranded DNA molecule that is also called Watson–Crick tape. Subsequently, these automata have two reading heads, one for each strand. While in traditional WK automata both heads read the whole input in the same physical direction, in $$5'\rightarrow 3'$$5′→3′ WK automata the heads start from the two extremes (say $$5'$$5′ end of the strands) and read the input in opposite direction. In sensing $$5'\rightarrow 3'$$5′→3′ WK automata the process on the input is finished when the heads meet. Since the heads of a WK automaton may read longer strings in a transition, in previous models a so-called sensing parameter took care for the proper meeting of the heads (not allowing to read the same positions of the input in the last step). Recently a new model is investigated, which works without the sensing parameter. In this paper, the deterministic counterpart is studied and is proven to accept the language class 2detLIN defined by the deterministic variant of the earlier version. However, using some of the restricted variants, e.g, all-final automata, the classes of the accepted languages are changed showing a finer hierarchy inside the class of linear context-free languages.Graphical Abstract:

中文翻译：

---

关于确定性感知 $$5'\rightarrow 3'$$5'→3' Watson–Crick 有限自动机：2detLIN 中的完整层次结构

Watson-Crick（缩写为 WK）有限自动机正在研究双链 DNA 分子，也称为 Watson-Crick 带。随后，这些自动机有两个读取头，每个链一个。而在传统的 WK 自动机中，两个头都在相同的物理方向上读取整个输入，而在 $$5'\rightarrow 3'$$5'→3' WK 自动机中，头从两个极端开始（比如 $$5'$$5' end of股）并以相反的方向读取输入。在感知 $$5'\rightarrow 3'$$5'→3' WK 自动机中，当头部相遇时，输入的过程就完成了。由于 WK 自动机的头部可能会在转换中读取更长的字符串，因此在以前的模型中，一个所谓的传感参数负责头部的正确相遇（不允许读取最后一步中输入的相同位置）。最近研究了一种新模型，它在没有传感参数的情况下工作。在本文中，确定性对应物被研究并被证明接受由早期版本的确定性变体定义的语言类 2detLIN。然而，使用一些受限制的变体，例如，全最终自动机，被接受的语言的类被改变，在线性上下文无关语言的类中显示出更精细的层次结构。图形摘要：