Skip to main content

In vitro implementation of finite-state machines

  • Contributed Papers
  • Conference paper
  • First Online:
Book cover Automata Implementation (WIA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1436))

Included in the following conference series:

Abstract

We explore the information processing capabilities and efficiency of DNA computations by giving two different types of implementations of finite-state machines. A ligation-based approach allows input of arbitrary length and can be readily implemented with current biotechnology, but requires sequential input feed and different molecules for different machines. In a second implementation not based on ligation, transitions are represented by reusable molecules, and the input, coded as a molecule, can be introduced at once. We extend the technique for programmable fault-tolerant implementation of nondeterministic finite-state machines by enforcings the basic conditions in the subset constructions that permit efficient computation. All implementations allow optical extraction of the status of the machine.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.M. Adleman (1994).Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024.

    Google Scholar 

  2. E. Baum (1996). Running Dynamic Programming algorithms on a DNA computer. in [16], 141–147.

    Google Scholar 

  3. R. Deaton, R.C. Murphy, M. Garton, D.R. Franceschetti, S.E. Stevens, Jr. (1995). Good Encodings for DNA-based Solutions to Combinatorial Problems. In [16], 159–171.

    Google Scholar 

  4. R. Deaton, M. Garton, R.C. Murphy, J.A. Rose, D.R. Franceschetti, S.E. Stevens, Jr.. Realiability and Efficiency of a DNA Computation. Physical Review Letters, in press.

    Google Scholar 

  5. R. Deaton, M. Garton, R.C. Murphy, J.A. Rose, D.R. Franceschetti, S.E. Stevens, Jr.. Genetic Search of Realiable Encodings for DNA-based Computation. In Late-Breaking Papers at the Genetic Programming Conference, Stanford University, July 1996, pp 9–15.

    Google Scholar 

  6. R. Deaton, D.R. Franceschetti, M. Garton, J.A. Rose, R.C. Murphy, S.E. Stevens, Jr. Information Transfer through Hybridization Reactions in DNA based Computing. In [13] (

    Google Scholar 

  7. M. Garton, E. Eberbach. Dynamical Implementation of Nondeterministic Automata and Concurrent Systems. In [17].

    Google Scholar 

  8. M.R. Garey, D.S. Johnson (1979). Computers and Intractability, Freeman, New York.

    Google Scholar 

  9. M. Garton, P. Neathery, R. Deaton, R.C. Murphy, D.R. Franschetti, S.E. Stevens Jr. A New Metric for DNA Computing. In [13]. (

    Google Scholar 

  10. F. Guarnieri, M. Fliss, C. Bancroft (1996). Making DNA Add. Science 273 220–223.

    Google Scholar 

  11. J.E. Hopcroft, J.F. Unman: Introduction to automata theory, languages and computation. Allison-Wesley, Reading MA, 1979

    Google Scholar 

  12. J.H. Johnson, D. Wood (1997): Instruction Computation in Subset Construction. In [17], 1–9.

    Google Scholar 

  13. J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo (eds.) (1997). Proceedings of the Second Annual Genetic Programming Conference, Stanford University. San Francisco, CA: Morgan Kaufmann.

    Google Scholar 

  14. M. Nelson, E. Raschke, M. McClelland (1993): Effect of site-specific methylation on restriction endonucleases and DNA modification methyltranferases. Nucleic Acids Research, 21:13, 3139.

    Google Scholar 

  15. J.S. Oliver (1996): Computation with DNA-Matrix Multiplication. in [16], pp 236–248.

    Google Scholar 

  16. E. Baum, D. Boneh, P. Kaplan, R. Lipton, J. Reif, N. Seeman (eds.) (1997). Second Annual Meeting on DNA based computers, DIMACS workshop, Princeton University, 1996. To be published in DIMACS series of the American Mathematical Society.

    Google Scholar 

  17. D. Raymond, D. Wood (eds) (1997). Automata Implementation. Proc. First Int. Workshop on Implementing Automata, WIA'96, London, Ontario, 1996. Lecture Notes in Computer Science 1260, Springer-Verlag, 1997.

    Google Scholar 

  18. J.A. Rose, Y. Gao, M. Garzon, and R. C. Murphy DNA Implementation of FiniteState Machines. In [13]. (

    Google Scholar 

  19. J.A. Rose, Y. Gao, M. Garzon, and R. C. Murphy DNA Implementation of nondeterminism. In Proc. [22].

    Google Scholar 

  20. L. Streyer (1995). Biochemistry. Freeman & Co.

    Google Scholar 

  21. J.D. Watson, Hopkins, N. H., Roberts, J. W., Steitz, J. A., and Weiner, A. M. (1987). Molecular Biology of the Gene. The Benjamin/Cummings Publishing Co., Inc, Menlo Park, CA fourth edition.

    Google Scholar 

  22. D. Wood, R. Lipton, J. Reif, N. Seeman (eds.) (1997). Third Annual Meeting on DNA based computers, DIMACS workshop, U. of Pennsylvania, June 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Garzon .

Editor information

Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garzon, M. et al. (1998). In vitro implementation of finite-state machines. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031381

Download citation

  • DOI: https://doi.org/10.1007/BFb0031381

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64694-5

  • Online ISBN: 978-3-540-69104-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics