Learn More
We present the result of the article [1], in which 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 is given. The Shapiro automaton action is based on cyclic cutting and ligating of DNA molecules. Its distinctive features included the fact that it was(More)
Great advances in biotechnology have allowed the construction of a computer from DNA. One of the proposed solutions is a biomolecular finite automaton, a simple two-state DNA computer without memory, which was presented by Ehud Shapiro's group at the Weizmann Institute of Science. The main problem with this computer, in which biomolecules carry out logical(More)
  • 1