Skip to main content

Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3892))

Abstract

We report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. First, we employ the length-encoding technique proposed and presented in [4, 3] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized double-strand DNA. Second, we design and develop practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata of from 2 states to 6 states for several input strings. To our knowledge, this is the first in vitro experiments that have succeeded to execute 6-states automaton in test tube.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benenson, Y., Paz-Ellzur, T., Adar, R., Keinan, E., Livneh, Z., Shapiro, E.: Programmable and autonomous computing machine made of biomolecules. Nature 414, 430–434 (2001)

    Article  Google Scholar 

  2. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. Springer, Heidelberg (1998)

    Book  MATH  Google Scholar 

  3. Sakakibara, Y., Hohsaka, T.: In Vitro Translation-based Computations. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 175–179. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Yokomori, T., Sakakibara, Y., Kobayashi, S.: A Magic Pot: Self-assembly computation revisited. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 418–429. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuramochi, J., Sakakibara, Y. (2006). Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube. In: Carbone, A., Pierce, N.A. (eds) DNA Computing. DNA 2005. Lecture Notes in Computer Science, vol 3892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753681_15

Download citation

  • DOI: https://doi.org/10.1007/11753681_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34161-1

  • Online ISBN: 978-3-540-34165-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics