Skip to main content
Log in

DNA computing, sticker systems, and universality

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We introduce the sticker systems, a computability model, which is an abstraction of the computations using the Watson-Crick complementarity as in Adleman's DNA computing experiment, [1]. Several types of sticker systems are shown to characterize (modulo a weak coding) the regular languages, hence the power of finite automata. One variant is proven to be equivalent to Turing machines. Another one is found to have a strictly intermediate power.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 10 October 1996 / 16 April 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kari, L., Păun, G., Rozenberg, G. et al. DNA computing, sticker systems, and universality. Acta Informatica 35, 401–420 (1998). https://doi.org/10.1007/s002360050125

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050125

Keywords

Navigation