Programmable Transducer Implemented by DNA Self-assembly

joint work with: B. Chakraborty and N.C. Seeman

There have been several models of finite state automata in biomolecular computing and some implementations as well. On the other side, DNA self assembly of two-dimensional arrays have been achieved by variety of tiles, even more, algorithmic self assembly simulations of the Sierpinski triangle and binary counters have also been recorded. With this talk we show an implementation of a finite state transducer (finite state automaton with output) by Wang like tiles simulated with triple cross-over DNA molecules. It has been observed that a composition of such transducers can simulate all computational functions. This is a reusable and programmable implementation capable of producing a variety of two-dimensional arrays.