Transducers with programmable input by DNA self-assembly

Nataša Jonoska, Shiping Liao, Nadrian Seeman

Research output: Contribution to journalArticle

Abstract

Notions of Wang tiles, finite state machines and recursive functions are tied together. We show that there is a natural way to simulate finite state machines with output (transducers) with Wang tiles and we show that recursive (computable) functions can be obtained as composition of transducers through employing Wang tiles. We also show how a programmable transducer can be self-assembled using TX DNA molecules simulating Wang tiles and a linear array of DNA PX-JX2 nanodevices.

Original languageEnglish (US)
Pages (from-to)219-240
Number of pages22
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2950
StatePublished - 2004

Fingerprint

Self-assembly
Tile
Transducers
Transducer
Self assembly
DNA
Recursive functions
Finite automata
State Machine
Oligonucleotide Array Sequence Analysis
Recursive Functions
Linear Array
Molecules
Output
Chemical analysis

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{50936d05ed36419fa1454059acee3371,
title = "Transducers with programmable input by DNA self-assembly",
abstract = "Notions of Wang tiles, finite state machines and recursive functions are tied together. We show that there is a natural way to simulate finite state machines with output (transducers) with Wang tiles and we show that recursive (computable) functions can be obtained as composition of transducers through employing Wang tiles. We also show how a programmable transducer can be self-assembled using TX DNA molecules simulating Wang tiles and a linear array of DNA PX-JX2 nanodevices.",
author = "Nataša Jonoska and Shiping Liao and Nadrian Seeman",
year = "2004",
language = "English (US)",
volume = "2950",
pages = "219--240",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Transducers with programmable input by DNA self-assembly

AU - Jonoska, Nataša

AU - Liao, Shiping

AU - Seeman, Nadrian

PY - 2004

Y1 - 2004

N2 - Notions of Wang tiles, finite state machines and recursive functions are tied together. We show that there is a natural way to simulate finite state machines with output (transducers) with Wang tiles and we show that recursive (computable) functions can be obtained as composition of transducers through employing Wang tiles. We also show how a programmable transducer can be self-assembled using TX DNA molecules simulating Wang tiles and a linear array of DNA PX-JX2 nanodevices.

AB - Notions of Wang tiles, finite state machines and recursive functions are tied together. We show that there is a natural way to simulate finite state machines with output (transducers) with Wang tiles and we show that recursive (computable) functions can be obtained as composition of transducers through employing Wang tiles. We also show how a programmable transducer can be self-assembled using TX DNA molecules simulating Wang tiles and a linear array of DNA PX-JX2 nanodevices.

UR - http://www.scopus.com/inward/record.url?scp=35048813563&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048813563&partnerID=8YFLogxK

M3 - Article

VL - 2950

SP - 219

EP - 240

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -