An autonomous DNA model for finite state automata.
In this paper we introduce an autonomous DNA model for finite state automata. This model called sticker automaton model is based on the hybridisation of single stranded DNA molecules (stickers) encoding transition rules and input data. The computation is carried out in an autonomous manner by one enzyme which allows us to determine whether a resulting double-stranded DNA molecule belongs to the automaton's language or not.
Martinez-Perez
Israel M
IM
Institute of Computer Technology, Hamburg University of Technology, Hamburg 21073, Germany. martinez-perez@tu-harburg.de
Zimmermann
Karl-Heinz
KH
Ignatova
Zoya
Z
D001331:Automation / Q000379:methods; D003198:Computer Simulation; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry* / Q000378:metabolism; D004277:DNA, Single-Stranded / Q000737:chemistry; D008962:Models, Theoretical
D004277:DNA, Single-Stranded; D004247:DNA