On the universality of Post and splicing systems

C. Ferretti, G. Mauri, S. Kobayashi, T. Yokomori

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing systems.

Original languageEnglish
Pages (from-to)157-170
Number of pages14
JournalTheoretical Computer Science
Volume231
Issue number2
DOIs
Publication statusPublished - 2000 Jan 28
Externally publishedYes

Keywords

  • DNA computer
  • Post system
  • Splicing system

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the universality of Post and splicing systems'. Together they form a unique fingerprint.

  • Cite this