Here we study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic $\mathsf{R}(1)$-automata. We study the expressive power of these systems by relating the class of languages that they accept by mode =1 computations to other well-studied language classes, showing in particular that this class only contains semi-linear languages. Our model can be viewed as a nondeterministic finite-state acceptor with translucent letters, that is, it processes its input in a different way than the usual left-to-right order. In this way all commutative semi-linear languages, and in fact all rational trace languages, can be accepted. In addition, we investigate the closure and non-closure properties of the class of languages accepted by our model and some of its algorithmic properties.

Here we study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic $\mathsf{R}(1)$-自动机。我们通过将模式= 1计算接受的语言类别与其他经过深入研究的语言类别相关联，研究了这些系统的表达能力，尤其表明该类别仅包含半线性语言。我们的模型可以看作是具有半透明字母的不确定性有限状态接受器，也就是说，它以不同于通常的从左到右顺序的方式来处理其输入。这样，所有可交换的半线性语言，实际上所有有理的跟踪语言都可以被接受。此外，我们研究了模型接受的语言类别的闭包和非闭包属性及其某些算法属性。