We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down automata, using circular DNA molecules and a class IIs restriction enzyme. The proposed ideas are inspired by the results from . The same ideas are extended to show a way to implement push-down automata with two stacks (i.e, universal computing devices) using two circular molecules glued with a DX molecule and a class IIs restriction enzyme. In this case each computational molecule also contains a DX portion. These devices can potentially be incorporated in an array of TX molecules.
|Number of pages||15|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||10th International Workshop on DNA Computing, DNA 10 - Milan, Italy|
Duration: 7 Jun 2004 → 10 Jun 2004