Networks of Standard Watson-Crick D0L Systems with Incomplete Information Communication

Abstract

Watson-Crick D0L systems (WD0L systems) are variants of D0L systems with controlled derivations, inspired by the phenomenon of Watson-Crick complementarity of the familiar double helix of DNA. These systems are defined over a DNA-like alphabet, i.e. each letter has a complementary letter and this relation is symmetric. Depending on a special condition, called the trigger, a parallel rewriting step is applied either to the string or to its complementary string. A network of Watson-Crick D0L systems (an NWD0L system) is a finite set of WD0L systems over a common DNA-like alphabet which act on their own strings in parallel and after each derivation step send copies some of the generated words to the other nodes. In [2] it was shown that the so-called standard NWD0L systems form a class of computationally complete devices, that is, any recursively enumerable language can be determined by a network of standard Watson-Crick D0L systems. In this paper we prove that the computational power of these constructs does not change in the case of a certain type of incomplete information communication, namely where the communicated word is a non-empty prefix of the generated word. An analogous statement can be given for the case where the communicated word is a non-empty suffix of the string.KeywordsMaster NodeEmpty WordDerivation StepGood WordCorrected StringThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.