Skip to main content
Log in

Transducer generated arrays of robotic nano-arms

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

We consider sets of two-dimensional arrays, called here transducer generated languages, obtained by iterative applications of transducers (finite state automata with output). Each transducer generates a set of blocks of symbols such that the bottom row of a block is an input string accepted by the transducer and, by iterative application of the transducer, each row of the block is an output of the transducer on the preceding row. We show how these arrays can be implemented through molecular assembly of triple crossover DNA molecules. Such assembly could serve as a scaffold for arranging molecular robotic arms capable of simultaneous movements. We observe that transducer generated languages define a class of languages which is a proper subclass of recognizable picture languages, but it contains the class of all factorial local two-dimensional languages. By taking the average growth rate of the number of blocks in the language as a measure of its complexity, we further observe that arrays with high complexity patterns can be generated in this way.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Notes

  1. Often in literature the symbol used as the boundary symbol is # which we use to denote the cardinality of a set.

References

  • Anselmo M, Giammarresi D, Madonia M (2007a) Tiling automaton: a computational model for recognizable two-dimensional languages. In: Holub J, Žd'árek J (eds) CIAA 2007. LNCS, vol 4783. Springer-Verlag, Berlin, pp 290–302

  • Anselmo M, Giammarresi D, Madonia M (2007b) From determinism to non-determinism in recognizable two-dimensional languages. In: Harju T, Karhumaki J, Lepisto A (eds) DLT 2007. LNCS, vol 4588. Springer-Verlag, Berlin, pp 36–47

  • Anselmo M, Giammarresi D, Madonia M, Restivo A (2006) Unambiguous recognizable two-dimensional languages. RAIRO-Inf Theor Appl 40:277–293

    Google Scholar 

  • Anselmo M, Jonoska N, Madonia M (2009) Framed versus unframed two-dimensional languages. In: Nielsen M et al (eds) SOFSEM 09. LNCS, vol 5404. Springer-Verlag, pp 79–92

  • Chakraborty B, Jonoska N, Seeman NC Programmable transducer by DNA self-assembly, submitted

  • Ding B, Seeman NC (2006) Operation of a DNA robot arm inserted into a 2d DNA crystalline substrate. Science 314:1583–1585

    Article  Google Scholar 

  • Dolzhenko E, Jonoska N (2008) On complexity of two-dimensional languages generated by transducers. In: Ibaraa O et al. (eds) Implementation and application of Automata ’09. LNCS, vol 5148. Springer, pp 181–190

  • Fu TJ, Seeman NC (1993) DNA double crossover structures. Biochemistry 32:3211–3220

    Article  Google Scholar 

  • Garibotti AV, Liao S, Seeman NC (2007) A simple DNA-based translation system. Nano Lett 7(2):480–483

    Google Scholar 

  • Giammarresi D, Restivo A (1992) Recognizable picture languages. In: Nivat M, Saoudi A, Wang PSP (eds) Proceedings of the 1st international colloquium on parallel image processing. Int J Pattern Recognit Artif Intell 6:231–256

  • Giammarresi D, Restivo A (1997) Two-dimensional languages. Handbook of formal languages, vol 3. Springer, Berlin, pp 215–267

    Google Scholar 

  • Gottschalk WH, Hedlund GA (1955) Topological dynamics. AMS Colloquium Pubs 36

  • Jonoska N, Liao S, Seeman NC (2004) Transducers with programmable input by DNA self-assembly. In: Jonoska N, Paŭn Gh, Rozenberg G (eds) Aspects in molecular computing. Lecture Notes in Computer Science, vol 2950. Springer, pp 219–240

  • Jonoska N, Pirnot JB (2006) Transitivity in two-dimensional local languages defined by dot systems. Int J Found Comput Sci 17:435–464

    Article  MATH  MathSciNet  Google Scholar 

  • Jonoska N, Pirnot JB (2007) Finite state automata representing two-dimensional subshifts. In: Holub J, Žďárek J (eds) CIAA 2007. LNCS, vol 4783. Springer-Verlag, pp 277–289

  • Kari J (1996) A small aperiodic set of Wang tiles. Discret Math 160(1–3):259–264

    Google Scholar 

  • Kari J, Moore C Rectangles and squares recognized by two-dimensional automata. http://www.santafe.edu/~moore/pubs/picture.html

  • Kari J, Moore C (2001) New results on alternating and non-deterministic two-dimensional finite automata. In: Proceedings of STACS 2001. LNCS, vol 2010. Springer-Verlag, pp 396–406

  • Kitchens B, Schmidt K (1989) Automorphisms of compact groups. Ergod Th Dyn Syst 9:691–735

    Article  MATH  MathSciNet  Google Scholar 

  • Kitchens B, Schmidt K (1992) Markov subgroups of \(({\mathbb Z}/2{\mathbb Z})^{{\mathbb Z}^2}.\) In: Walters P (ed) Symbolic dynamics and its applications contemporary mathematics. AMS, Contemporary Math 135:265–283

  • LaBean TH, Yan H, Kopatsch J, Liu F, Winfree E, Reif JH, Seeman NC (2000) The construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J Am Chem Soc 122:1848–1860

    Article  Google Scholar 

  • Latteux M, Simplot D, Terlutte A (1998) Iterated length-preserving rational transductions. In: Brim L et al (eds) MFCS ’98. LNCS, vol 1450. Springer-Verlag, pp 286–295

  • Liao S, Seeman NC (2004) Translation of DNA signals into polymer assembly instructions. Science 306:2072–2074

    Article  Google Scholar 

  • Lind D, Marcus B (1995) An introduction to symbolic dynamics and coding. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Manca V, Martin-Vide C, Păun Gh (1999) New computing paradigms suggested by DNA computing: computing by carving. BioSystems 52:47–54

    Article  Google Scholar 

  • Mao C, LaBean TH, Reif JH, Seeman NC (2000) Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407:493–496

    Article  Google Scholar 

  • Păun Gh (1978) On the iteration of gsm mappings. Rev Roum Math Pures Appl 23(4):921–937

    MATH  Google Scholar 

  • Rothemund P, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA sierpinski triangles. PLoS Biol 2(12):e424. http://biology.plosjournals.org/perlserv/?request=get-document&doi=10.1371/journal.pbio.0020424&ct=1

    Google Scholar 

  • Shen Z, Yan H, Wang T, Seeman NC (2004) Paranemic crossover DNA: a generalized holliday structure with applications in nanotechnology. J Am Chem Soc 126:1666–1674

    Article  Google Scholar 

  • Winfree E, Liu F, Wenzler LA, Seeman NC (1998) Design and self-assembly of two-dimensional DNA crystals. Nature 394:539–544

    Article  Google Scholar 

  • Winfree E (2000) Algorithmic self-assembly of DNA: theoretical motivations and 2D assembly experiments. J Biomol Struct Dyn 11(S2):263–270

    Google Scholar 

  • Yan H, Zhang X, Shen Z, Seeman NC (2000) A robust DNA mechanical device controlled by hybridization topology. Nature 415:62–65

    Article  Google Scholar 

  • Zheng J, Constantinou PE, Micheel C, Alivisatos AP, Kiehl RA, Seeman NC (2006) 2D Nanoparticle arrays show the organizational power of robust DNA motifs. Nano Lett 6:1502–1504

    Article  Google Scholar 

Download references

Acknowledgements

This work has been supported in part by the NSF grants CCF #0523928 and CCF #0726396 to N.J. and by grants GM-29554 from NIGMS, grants DMI-0210844, EIA-0086015, CCF-0432009, CCF-0523290 and CTS-0548774, CTS-0608889 from the NSF, 48681-EL and W911NF-07-1-0439 from ARO, N000140910181 from the office of Naval Research and a grant from the W.M. Keck Foundation, to N.C.S.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Egor Dolzhenko.

Additional information

This paper is written for the occasion of the 60th birthday of our dear friend Giancarlo Mauri. Happy birthday Giancarlo!

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dolzhenko, E., Jonoska, N. & Seeman, N.C. Transducer generated arrays of robotic nano-arms. Nat Comput 9, 437–455 (2010). https://doi.org/10.1007/s11047-009-9157-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-009-9157-5

Keywords

Navigation