Abstract
DNA computing aims at using nucleic acids for computing. Micro-molar DNA solutions can act as billions of parallel nanoprocessors with few consume. Finite automation is a general compute model. Now, A programmable finite automation based on DNA computing is available[1]. It’s act as a basic features and processes of a finite automaton with two internal states and an alphabet comprising two input symbols. Here we describe a new finite automata made of biomolecules, which can be used as a programmable pushdown store.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benenson, Y., Paz-Elizur, T., Adar, R.: Programmable and Autonomous Computing Machine Made of Biomoleculars. Nature 414(6862), 430–434 (2001)
Head., T.: Formal Language Theory and DNA: An Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987)
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266(11), 1021–1023 (1994)
Lipton, R.J.: DNA Solution of Hard Computational Problem. Science 268, 542–545 (1995)
Ouyang, Q., Kaplan, P.D., Liu, S.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Landweber, L.F., Lipton, R.J., Rabin, M.O.: DNA Based Computers III: DIMACS Workshop. In: Rubin, H., Wood, D.H. (eds.), June 23-27, pp. 161–172. University of Pennsylvania (1997)
Liu, Q.: DNA Computing on Surfaces. Nature 403, 175–179 (2000)
Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular Computation: RNA Solutions to Chess Problems. Proc. Natl. Acad. Sci. 97, 1385–1389 (2000)
Ruben, A.J., Landweber, L.F.: The Past, Present and Future of Molecular Computing. Nature Rev. Mol.Cell Biol. 1, 69–72 (2000)
Roweis, S., Winfree, E., Burgoyne, R., Goodman, M., Rothemund, P., Adleman, L.A.: Sticker Based Model for DNA Computation. In: 2nd DIMACS Workshop on DNA Based Computers, Princeton. DIMACS Series, pp. 1–29 (1999)
Kari, L.: DNA Computing: Arrival of Biological Mathematics. Math. Intelligencer 19(2), 9–22 (1997)
Praun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)
Sakamoto, K., Gouzu, H., Komiya, K.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)
Head, T., Rozenberg, G., Bladergroen, R.B., Breek, C.K.D., Lommerse, P.H.M., Spaink, H.P.: Computing with DNA by Operating on Plasmids. BioSystems 57, 87–93 (2000)
Benenson, Y., Paz-Elizur, T., Adar, R.: Programmable and Autonomous Computing Machine Made of Biomoleculars. Nature 414(6862), 430–434 (2001)
Shi, X.L., Li, X., Zhang, Z., et al.: Improve Capability of DNA Automaton: DNA Automaton with Three Internal States and Tape Head Move in Two Directions. In: Huang, D.-S., Zhang, X.-P., Huang, G.-B. (eds.) ICIC 2005. LNCS, vol. 3645, pp. 71–79. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Xu, J., Liu, J., Pan, L. (2006). Programmable Pushdown Store Base on DNA Computing. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_31
Download citation
DOI: https://doi.org/10.1007/11816102_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)