The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Handbook of Formal Languages
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Magic Pot: Self-assembly Computation Revisited
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Molecular Assembly and Computation: From Theory to Experimental Demonstrations
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Horn Clause Computation by Self-assembly of DNA Molecules
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A Realization of Information Gate by Using Enterococcus faecalis Pheromone System
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Application of DNA Computing by Self-assembly on 0-1 Knapsack Problem
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III
Algorithmic applications of XPCR
Natural Computing: an international journal
Computational biology: a programming perspective
Formal modeling
Design, simulation, and experimental demonstration of self-assembled DNA nanostructures and motors
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Programming and evolving physical self-assembling systems in three dimensions
Natural Computing: an international journal
| Hi-index | 0.00 |
This paper investigates computation by linear assemblies of complex DNA tiles, which we call string tiles. By keeping track of the strands as they weave back and forth through the assembly, we show that surprisingly sophisticated calculations can be performed using linear self-assembly. Examples range from generating an addition table to providing O(1) solutions to CNF-SAT and DHPP. We classify the families of languages that can be generated by various types of DNA molecules, and establish a correspondence to the existing classes ET0Lml and ET0Lfin. Thus, linear self-assembly of string tiles can generate the output languages of finite-visit Turing Machines.