Zimmermann, Karl-HeinzKarl-HeinzZimmermannMartínez Pérez, Israel MarckIsrael MarckMartínez PérezIgnatova, ZoyaZoyaIgnatova2006-06-022006-06-022006-05https://hdl.handle.net/11420/242This technical report introduces an autonomous DNA model for finite state automata. This model called sticker automata model is based on the hybridization of single stranded DNA molecules (stickers) encoding transition rules and input data. The computation is carried out in an autonomous manner by one enzyme and will allow to determine whether a resulting double-stranded DNA molecule belongs to the automaton's language or not.enhttp://rightsstatements.org/vocab/InC/1.0/Rechnen mit DNAendliche AutomatenDNA computingfinite state machinesInformatikBiowissenschaften, BiologieWorking Paper2006-06-02urn:nbn:de:gbv:830-opus-308110.15480/882.240endlicher AutomatGenetics and population dynamicsTheory of computing11420/24210.15480/882.240930768402Working Paper