Networks of standard Watson-Crick D0L systems with incomplete information communication

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Watson-Crick D0L systems (W D0L 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 NW D0L system) is a finite set of W D0L 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 NW D0L 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.

Original languageEnglish
Pages (from-to)35-48
Number of pages14
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3113
Publication statusPublished - 2004

Fingerprint

Incomplete Information
DNA
Communication
Strings
Language
Equipment and Supplies
Recursively Enumerable Languages
Suffix
Standards
Complementarity
Prefix
Rewriting
Helix
Trigger
Finite Set
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{cae8df35a5124eaa96b566dab3a56294,
title = "Networks of standard Watson-Crick D0L systems with incomplete information communication",
abstract = "Watson-Crick D0L systems (W D0L 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 NW D0L system) is a finite set of W D0L 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 NW D0L 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.",
author = "Erzs{\'e}bet Csuhaj-Varj{\'u}",
year = "2004",
language = "English",
volume = "3113",
pages = "35--48",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Networks of standard Watson-Crick D0L systems with incomplete information communication

AU - Csuhaj-Varjú, Erzsébet

PY - 2004

Y1 - 2004

N2 - Watson-Crick D0L systems (W D0L 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 NW D0L system) is a finite set of W D0L 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 NW D0L 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.

AB - Watson-Crick D0L systems (W D0L 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 NW D0L system) is a finite set of W D0L 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 NW D0L 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.

UR - http://www.scopus.com/inward/record.url?scp=35048831868&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048831868&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048831868

VL - 3113

SP - 35

EP - 48

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -