Sticker systems

34Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free