Biomolecular implementation of computing devices with unbounded memory

Authors:
Matteo Cavaliere;Nataša Jonoska;Sivan Yogev;Ron Piran;Ehud Keinan;Nadrian C. Seeman
Affiliations:
Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Department of Mathematics, University of South Florida, Tampa, FL;Department of Computer Science, Technion, Haifa, Israel;Department of Chemistry, Technion, Haifa, Israel;Department of Chemistry, Technion, Haifa, Israel;Department of Chemistry, New York University, New York, NY
Venue:
DNA'04 Proceedings of the 10th international conference on DNA computing
Year:
2004

Citing 3
Cited 1

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A DNA-based Computational Model Using a Specific Type of Restriction Enzyme

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
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)

Arithmetical Analysis of Biomolecular Finite Automaton

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [1]. 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.