DNA computing, sticker systems, and universality

@article{Kari1998DNACS,
  title={DNA computing, sticker systems, and universality},
  author={Lila Kari and Gheorghe Paun and Grzegorz Rozenberg and Arto Salomaa and Sheng Yu},
  journal={Acta Informatica},
  year={1998},
  volume={35},
  pages={401-420}
}
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.