From Watson-Crick L systems to Darwinian P systems

E. Csuhaj-Varjú, Carlos Martín-Vide, Gheorgh Pǎaun, Arto Salomaa

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Watson-Crick L systems are language generating devices making use of Watson-Crick complementarity, a fundamental concept of DNA computing. These devices are Lindenmayer systems enriched with a trigger for complementarity transition: if a "bad" string is obtained, then the derivation continues with its complement which is always a "good" string. Membrane systems or P systems are distributed parallel computing models which were abstracted from the structure and the way of functioning of living cells. In this paper, we first interpret the results known about the computational completeness of Watson-Crick E0L systems in terms of membrane systems, then we introduce a related way of controlling the evolution in P systems, by using the triggers not in the operational manner (i.e., turning to the complement in a "bad" configuration), but in a "Darwinian" sense: if a "bad" configuration is reached, then the system "dies", that is, no result is obtained. The triggers (actually, the checkers) are given as finite state multiset automata. We investigate the computational power of these P systems. Their computational completeness is proved, even for systems with non-cooperative rules, working in the non-synchronized way, and controlled by only two finite state checkers; if the systems work in the synchronized mode, then one checker for each system suffices to obtain the computational completeness.

Original languageEnglish
Pages (from-to)299-318
Number of pages20
JournalNatural Computing
Volume2
Issue number3
DOIs
Publication statusPublished - 2003

Fingerprint

Membranes
Finite automata
Parallel processing systems
DNA
Cells

Keywords

  • L system
  • Membrane computing
  • P system
  • Recursively enumerable language
  • Watson-Crick complementarity

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

From Watson-Crick L systems to Darwinian P systems. / Csuhaj-Varjú, E.; Martín-Vide, Carlos; Pǎaun, Gheorgh; Salomaa, Arto.

In: Natural Computing, Vol. 2, No. 3, 2003, p. 299-318.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E, Martín-Vide, C, Pǎaun, G & Salomaa, A 2003, 'From Watson-Crick L systems to Darwinian P systems', Natural Computing, vol. 2, no. 3, pp. 299-318. https://doi.org/10.1023/A:1025415914487
Csuhaj-Varjú, E. ; Martín-Vide, Carlos ; Pǎaun, Gheorgh ; Salomaa, Arto. / From Watson-Crick L systems to Darwinian P systems. In: Natural Computing. 2003 ; Vol. 2, No. 3. pp. 299-318.
@article{4d03b94752b348d5ab05f2f0b43a6861,
title = "From Watson-Crick L systems to Darwinian P systems",
abstract = "Watson-Crick L systems are language generating devices making use of Watson-Crick complementarity, a fundamental concept of DNA computing. These devices are Lindenmayer systems enriched with a trigger for complementarity transition: if a {"}bad{"} string is obtained, then the derivation continues with its complement which is always a {"}good{"} string. Membrane systems or P systems are distributed parallel computing models which were abstracted from the structure and the way of functioning of living cells. In this paper, we first interpret the results known about the computational completeness of Watson-Crick E0L systems in terms of membrane systems, then we introduce a related way of controlling the evolution in P systems, by using the triggers not in the operational manner (i.e., turning to the complement in a {"}bad{"} configuration), but in a {"}Darwinian{"} sense: if a {"}bad{"} configuration is reached, then the system {"}dies{"}, that is, no result is obtained. The triggers (actually, the checkers) are given as finite state multiset automata. We investigate the computational power of these P systems. Their computational completeness is proved, even for systems with non-cooperative rules, working in the non-synchronized way, and controlled by only two finite state checkers; if the systems work in the synchronized mode, then one checker for each system suffices to obtain the computational completeness.",
keywords = "L system, Membrane computing, P system, Recursively enumerable language, Watson-Crick complementarity",
author = "E. Csuhaj-Varj{\'u} and Carlos Mart{\'i}n-Vide and Gheorgh Pǎaun and Arto Salomaa",
year = "2003",
doi = "10.1023/A:1025415914487",
language = "English",
volume = "2",
pages = "299--318",
journal = "Natural Computing",
issn = "1567-7818",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - From Watson-Crick L systems to Darwinian P systems

AU - Csuhaj-Varjú, E.

AU - Martín-Vide, Carlos

AU - Pǎaun, Gheorgh

AU - Salomaa, Arto

PY - 2003

Y1 - 2003

N2 - Watson-Crick L systems are language generating devices making use of Watson-Crick complementarity, a fundamental concept of DNA computing. These devices are Lindenmayer systems enriched with a trigger for complementarity transition: if a "bad" string is obtained, then the derivation continues with its complement which is always a "good" string. Membrane systems or P systems are distributed parallel computing models which were abstracted from the structure and the way of functioning of living cells. In this paper, we first interpret the results known about the computational completeness of Watson-Crick E0L systems in terms of membrane systems, then we introduce a related way of controlling the evolution in P systems, by using the triggers not in the operational manner (i.e., turning to the complement in a "bad" configuration), but in a "Darwinian" sense: if a "bad" configuration is reached, then the system "dies", that is, no result is obtained. The triggers (actually, the checkers) are given as finite state multiset automata. We investigate the computational power of these P systems. Their computational completeness is proved, even for systems with non-cooperative rules, working in the non-synchronized way, and controlled by only two finite state checkers; if the systems work in the synchronized mode, then one checker for each system suffices to obtain the computational completeness.

AB - Watson-Crick L systems are language generating devices making use of Watson-Crick complementarity, a fundamental concept of DNA computing. These devices are Lindenmayer systems enriched with a trigger for complementarity transition: if a "bad" string is obtained, then the derivation continues with its complement which is always a "good" string. Membrane systems or P systems are distributed parallel computing models which were abstracted from the structure and the way of functioning of living cells. In this paper, we first interpret the results known about the computational completeness of Watson-Crick E0L systems in terms of membrane systems, then we introduce a related way of controlling the evolution in P systems, by using the triggers not in the operational manner (i.e., turning to the complement in a "bad" configuration), but in a "Darwinian" sense: if a "bad" configuration is reached, then the system "dies", that is, no result is obtained. The triggers (actually, the checkers) are given as finite state multiset automata. We investigate the computational power of these P systems. Their computational completeness is proved, even for systems with non-cooperative rules, working in the non-synchronized way, and controlled by only two finite state checkers; if the systems work in the synchronized mode, then one checker for each system suffices to obtain the computational completeness.

KW - L system

KW - Membrane computing

KW - P system

KW - Recursively enumerable language

KW - Watson-Crick complementarity

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

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

U2 - 10.1023/A:1025415914487

DO - 10.1023/A:1025415914487

M3 - Article

AN - SCOPUS:4344669518

VL - 2

SP - 299

EP - 318

JO - Natural Computing

JF - Natural Computing

SN - 1567-7818

IS - 3

ER -