Multiple splicing systems and the universal computability

Satoshi Kobayashi, Yasubumi Sakakibara

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We propose a new extension of splicing systems, called multiple splicing systems, based on a kind of logic grammars. First, we introduce a class of Elementary formal systems, called simple H-form EFS, and show that its generative power is equivalent to the class of basic splicing systems (the original Head's splicing system) and is more adequate as a representation device for formal languages. Next, we gradually extend the simple class of EFSs and get a very natural extension of splicing systems, multiple splicing systems. We show that multiple splicing systems have universal computability.

Original languageEnglish
Pages (from-to)3-23
Number of pages21
JournalTheoretical Computer Science
Volume264
Issue number1
DOIs
Publication statusPublished - 2001
Externally publishedYes

Fingerprint

Formal languages
Computability
Formal Languages
Natural Extension
Grammar
Logic

Keywords

  • Computability
  • DNA computing
  • Splicing system

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Multiple splicing systems and the universal computability. / Kobayashi, Satoshi; Sakakibara, Yasubumi.

In: Theoretical Computer Science, Vol. 264, No. 1, 2001, p. 3-23.

Research output: Contribution to journalArticle

@article{6b83916b5dae41bd99d7fb6180d0e040,
title = "Multiple splicing systems and the universal computability",
abstract = "We propose a new extension of splicing systems, called multiple splicing systems, based on a kind of logic grammars. First, we introduce a class of Elementary formal systems, called simple H-form EFS, and show that its generative power is equivalent to the class of basic splicing systems (the original Head's splicing system) and is more adequate as a representation device for formal languages. Next, we gradually extend the simple class of EFSs and get a very natural extension of splicing systems, multiple splicing systems. We show that multiple splicing systems have universal computability.",
keywords = "Computability, DNA computing, Splicing system",
author = "Satoshi Kobayashi and Yasubumi Sakakibara",
year = "2001",
doi = "10.1016/S0304-3975(00)00211-5",
language = "English",
volume = "264",
pages = "3--23",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Multiple splicing systems and the universal computability

AU - Kobayashi, Satoshi

AU - Sakakibara, Yasubumi

PY - 2001

Y1 - 2001

N2 - We propose a new extension of splicing systems, called multiple splicing systems, based on a kind of logic grammars. First, we introduce a class of Elementary formal systems, called simple H-form EFS, and show that its generative power is equivalent to the class of basic splicing systems (the original Head's splicing system) and is more adequate as a representation device for formal languages. Next, we gradually extend the simple class of EFSs and get a very natural extension of splicing systems, multiple splicing systems. We show that multiple splicing systems have universal computability.

AB - We propose a new extension of splicing systems, called multiple splicing systems, based on a kind of logic grammars. First, we introduce a class of Elementary formal systems, called simple H-form EFS, and show that its generative power is equivalent to the class of basic splicing systems (the original Head's splicing system) and is more adequate as a representation device for formal languages. Next, we gradually extend the simple class of EFSs and get a very natural extension of splicing systems, multiple splicing systems. We show that multiple splicing systems have universal computability.

KW - Computability

KW - DNA computing

KW - Splicing system

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

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

U2 - 10.1016/S0304-3975(00)00211-5

DO - 10.1016/S0304-3975(00)00211-5

M3 - Article

VL - 264

SP - 3

EP - 23

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -