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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 10 October 1996 / 16 April 1997
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s002360050125