Sticker systems is a computational model which is an abstraction of the way that the Watson-Crick complementarity is used in DNA computing. We consider such systems of a general form, with blocks of arbitrary shapes to be annealed to the currently built sequences. We investigate the generative power of several variants of sticker systems. Characterizations of regular, linear, and recursively enumerable languages are obtained in this framework. © 1998 - Elsevier Science B.V. All rights reserved.
Pǎun, G., & Rozenberg, G. (1998). Sticker systems. Theoretical Computer Science, 204(1–2), 183–203. https://doi.org/10.1016/S0304-3975(98)00039-5