Test tube distributed systems based on splicing

E. Csuhaj-Varjú, Lila Kari, Gheorghe Pǎun

Research output: Contribution to journalArticle

53 Citations (Scopus)

Abstract

We define a symbol processing mechanism with the components (test tubes) working as splicing schemes in the sense of T. Head and communicating by redistributing the contents of tubes (in a similar way to the separate operation of Lipton-Adleman). (These systems are similar to the distributed generative mechanisms called Parallel Communicating Grammar Systems.) Systems with finite initial contents of tubes and finite sets of splicing rules associated to each component are computationally complete, they characterize the family of recursively enumerable languages. The existence of universal test tube distributed systems is obtained on this basis, hence the theoretical proof of the possibility to design universal programmable computers with the structure of such a system.

Original languageEnglish
Pages (from-to)211-232
Number of pages22
JournalComputers and Artificial Intelligence
Volume15
Issue number2-3
Publication statusPublished - 1996

Fingerprint

Processing

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Test tube distributed systems based on splicing. / Csuhaj-Varjú, E.; Kari, Lila; Pǎun, Gheorghe.

In: Computers and Artificial Intelligence, Vol. 15, No. 2-3, 1996, p. 211-232.

Research output: Contribution to journalArticle

Csuhaj-Varjú, E. ; Kari, Lila ; Pǎun, Gheorghe. / Test tube distributed systems based on splicing. In: Computers and Artificial Intelligence. 1996 ; Vol. 15, No. 2-3. pp. 211-232.
@article{c9862d4ce15948ed8e13fcf3a7a52110,
title = "Test tube distributed systems based on splicing",
abstract = "We define a symbol processing mechanism with the components (test tubes) working as splicing schemes in the sense of T. Head and communicating by redistributing the contents of tubes (in a similar way to the separate operation of Lipton-Adleman). (These systems are similar to the distributed generative mechanisms called Parallel Communicating Grammar Systems.) Systems with finite initial contents of tubes and finite sets of splicing rules associated to each component are computationally complete, they characterize the family of recursively enumerable languages. The existence of universal test tube distributed systems is obtained on this basis, hence the theoretical proof of the possibility to design universal programmable computers with the structure of such a system.",
author = "E. Csuhaj-Varj{\'u} and Lila Kari and Gheorghe Pǎun",
year = "1996",
language = "English",
volume = "15",
pages = "211--232",
journal = "Computing and Informatics",
issn = "1335-9150",
publisher = "Slovak Academy of Sciences",
number = "2-3",

}

TY - JOUR

T1 - Test tube distributed systems based on splicing

AU - Csuhaj-Varjú, E.

AU - Kari, Lila

AU - Pǎun, Gheorghe

PY - 1996

Y1 - 1996

N2 - We define a symbol processing mechanism with the components (test tubes) working as splicing schemes in the sense of T. Head and communicating by redistributing the contents of tubes (in a similar way to the separate operation of Lipton-Adleman). (These systems are similar to the distributed generative mechanisms called Parallel Communicating Grammar Systems.) Systems with finite initial contents of tubes and finite sets of splicing rules associated to each component are computationally complete, they characterize the family of recursively enumerable languages. The existence of universal test tube distributed systems is obtained on this basis, hence the theoretical proof of the possibility to design universal programmable computers with the structure of such a system.

AB - We define a symbol processing mechanism with the components (test tubes) working as splicing schemes in the sense of T. Head and communicating by redistributing the contents of tubes (in a similar way to the separate operation of Lipton-Adleman). (These systems are similar to the distributed generative mechanisms called Parallel Communicating Grammar Systems.) Systems with finite initial contents of tubes and finite sets of splicing rules associated to each component are computationally complete, they characterize the family of recursively enumerable languages. The existence of universal test tube distributed systems is obtained on this basis, hence the theoretical proof of the possibility to design universal programmable computers with the structure of such a system.

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

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

M3 - Article

VL - 15

SP - 211

EP - 232

JO - Computing and Informatics

JF - Computing and Informatics

SN - 1335-9150

IS - 2-3

ER -