Watson-Crick D0L systems (WD0L systems) are augmented variants of D0L systems defined over a DNA-like alphabet, where each letter has a complementary letter and this relation is symmetric. WD0L systems operate under a control that is inspired by the well-known phenomenon of Watson-Crick complementarity of the double helix of DNA. Depending on a trigger, the standard D0L rewriting step is applied either to the string or to its complementary string. In this paper, we examine extended networks of standard Watson-Crick D0L systems (ENSWD0L systems) with a variant of incomplete communication. An NWD0L system is a finite set of WD0L systems defined over a common DNA-like alphabet and operating in a synchronized manner. After rewriting their own strings in the WD0L manner, they communicate copies of certain generated strings (the so-called good strings) to the other nodes. In some previous papers, it was shown that ENSWD0L systems are computationally complete, and their computational power does not change if the communicated string is a non-empty prefix (non-empty suffix) of the generated string. We strengthen the previous results, namely we show that ENSWD0L systems are computationally complete even if the communicated string is an arbitrary substring of the generated string.

中文翻译：

---

通过子串进行通信的 Watson-Crick D0L 系统网络

Watson-Crick D0L 系统（WD0L 系统）是在类似 DNA 的字母表上定义的 D0L 系统的增强变体，其中每个字母都有一个互补字母，并且这种关系是对称的。 WD0L 系统的运行控制受到众所周知的 DNA 双螺旋 Watson-Crick 互补现象的启发。根据触发器，标准 D0L 重写步骤应用于该字符串或其互补字符串。在本文中，我们研究了具有不完全通信变体的标准 Watson-Crick D0L 系统（ENSWD0L 系统）的扩展网络。 NWD0L 系统是一组有限的 WD0L 系统，通过通用的类似 DNA 的字母表定义并以同步方式运行。以 WD0L 方式重写自己的字符串后，它们将某些生成的字符串（所谓的好字符串）的副本传递给其他节点。在之前的一些论文中，表明 ENSWD0L 系统在计算上是完整的，如果通信的字符串是生成字符串的非空前缀（非空后缀），那么它们的计算能力不会改变。我们强化了之前的结果，即我们表明，即使通信的字符串是生成字符串的任意子字符串，ENSWD0L 系统在计算上也是完整的。