Finite state automata by DNA self-assembly

Nataša Jonoska, Nadrian C. Seeman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Several models of finite state automata in biomolecular computing are already in literature and some of these models have been also implemented in vitro showing their possible feasibility. On the other side, DNA self assembly of two-dimensional arrays have been achieved by variety of DNA-like tiles, moreover, algorithmic self assembly simulations of the Sierpinski triangle and binary counters have also been recorded. With this talk we describe an implementation of couple of models by DNA and we concentrate on the recent implementation of a finite state transducer (finite state automaton with output) by Wang like DNA tiles simulated with triple cross-over DNA molecules.

Original languageEnglish (US)
Title of host publicationICT Innovations 2010 - Second International Conference, ICT Innovations 2010, Revised Selected Papers
Pages1-4
Number of pages4
DOIs
StatePublished - 2011
Event2nd International Conference on Information and Communication Technologies, ICT Innovations 2010 - Ohrid, Macedonia, The Former Yugoslav Republic of
Duration: Sep 12 2010Sep 15 2010

Publication series

NameCommunications in Computer and Information Science
Volume83 CCIS
ISSN (Print)1865-0929

Other

Other2nd International Conference on Information and Communication Technologies, ICT Innovations 2010
Country/TerritoryMacedonia, The Former Yugoslav Republic of
CityOhrid
Period9/12/109/15/10

Keywords

  • DNA arrays
  • DNA tiles
  • finite state automata with output
  • picture languages
  • robotic arms
  • transducers

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Finite state automata by DNA self-assembly'. Together they form a unique fingerprint.

Cite this