Acta Informatica

, Volume 35, Issue 5, pp 401–420 | Cite as

DNA computing, sticker systems, and universality

  • Lila Kari
  • Gheorghe Păun
  • Grzegorz Rozenberg
  • Arto Salomaa
  • Sheng Yu

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Lila Kari
    • 1
  • Gheorghe Păun
    • 2
  • Grzegorz Rozenberg
    • 3
  • Arto Salomaa
    • 4
  • Sheng Yu
    • 1
  1. 1. Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7 CA
  2. 2. Institute of Mathematics of the Romanian Academy, P.O. Box 1 – 764, RO-70700 Bucureşti, Romania RO
  3. 3. Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands NL
  4. 4. Academy of Finland and Turku University, Department of Mathematics, FIN-20500 Turku, Finland FI

Personalised recommendations