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 Aug 16
Externally publishedYes

Keywords

  • Computability
  • DNA computing
  • Splicing system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Multiple splicing systems and the universal computability'. Together they form a unique fingerprint.

  • Cite this