Simulating Boolean circuits on a DNA computer
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The computational power of Benenson automata
Theoretical Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Autonomous programmable DNA nanorobotic devices using DNAzymes
Theoretical Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
A realization of DNA molecular machine that walks autonomously by using a restriction enzyme
DNA13'07 Proceedings of the 13th international conference on DNA computing
Biomolecular implementation of computing devices with unbounded memory
DNA'04 Proceedings of the 10th international conference on DNA computing
Designs of autonomous unidirectional walking DNA devices
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.00 |
In the paper we present a theoretical analysis of extension of the finite automaton built on DNA introduced by the Shapiro team to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.