Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. Therefore, they have two reading heads, one for each strand. In traditional WK automata both heads read the whole input in the same physical direction, but in \(5'\rightarrow 3'\) WK automata the heads start from the two extremes and read the input in opposite direction. In sensing \(5'\rightarrow 3'\) WK automata the process on the input is finished when the heads meet, and the model characterise the linear context-free languages. Deterministic variants are weaker, the class 2detLIN is accepted by them. In this paper a new concept, the state-determinism is investigated, that is in each configuration of a computation (if it is not finished yet) the next state is determined by the actual state of the configuration. There are various usual restrictions on WK automata, e.g., all-final, stateless or 1-limited variants. We place the new class, the state-deterministic \(5'\rightarrow 3'\) WK automata, into the hierarchy based on the accepted language classes. Further, various hierarchy results including combined restrictions, e.g., 1-limited all-final state-deterministic \(5'\rightarrow 3'\) WK automata are shown.

Watson-Crick (WK) 有限自动机正在处理 Watson-Crick 磁带，即 DNA 分子。因此，他们有两个读数头，每个链一个。在传统的 WK 自动机中，两个头都在相同的物理方向上读取整个输入，但在\(5'\rightarrow 3'\) WK 自动机中，头从两个极端开始并以相反的方向读取输入。在感测中\(5'\rightarrow 3'\)WK 自动机在头部相遇时完成对输入的处理，并且该模型表征线性上下文无关语言。确定性变体较弱，它们接受 2detLIN 类。在本文中，研究了一个新概念，即状态确定性，即在计算的每个配置（如果尚未完成）中，下一个状态由配置的实际状态确定。WK 自动机有各种常见的限制，例如全最终、无状态或 1 限制变体。我们将新类，状态确定性\(5'\rightarrow 3'\) WK 自动机放入基于接受的语言类的层次结构中。此外，各种层次结构结果包括组合限制，例如，1-limited all-final state-deterministic \(5'\rightarrow 3'\) 显示了 WK 自动机。