Freezing Simulates Non-freezing Tile Automata

  • Cameron Chalk
  • Austin Luchsinger
  • Eric Martinez
  • Robert Schweller
  • Andrew Winslow
  • Tim WylieEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11145)


Self-assembly is the process by which a system of particles randomly agitate and combine, through local interactions, to form larger complex structures. In this work, we fuse a particular well-studied generalization of tile assembly (the 2-Handed or Hierarchical Tile Assembly Model) with concepts from cellular automata such as states and state transitions characterized by neighboring states. This allows for a simplification of the concepts from active self-assembly, and gives us machinery to relate the disparate existing models. We show that this model, coined Tile Automata, is invariant with respect to freezing and non-freezing transition rules via a simulation theorem showing that any non-freezing tile automata system can be simulated by a freezing one. Freezing tile automata systems restrict state transitions such that each tile may visit a state only once, i.e., a tile may undergo only a finite number of transitions. We conjecture that this result can be used to show that the Signal-passing Tile Assembly Model is also invariant to this constraint via a series of simulation results between that model and the Tile Automata model. Further, we conjecture that this model can be used to consolidate the several oft-studied models of self-assembly wherein assemblies may break apart, such as the Signal-passing Tile Assembly Model, the negative-glue 2-Handed Tile Assembly Model, and the Size-Dependent Tile Assembly Model. Lastly, the Tile Automata model may prove useful in combining results in cellular automata with self-assembly.


  1. 1.
    Becker, F., Maldonado, D., Ollinger, N., Theyssier, G.: Universality in freezing cellular automata. CoRR, abs/1805.00059 (2018).
  2. 2.
    Cannon, S., Demaine, E.D., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: STACS. LIPIcs, vol. 20, pp. 172–184 (2013)Google Scholar
  3. 3.
    Demaine, E.D., Patitz, M.J., Rogers, T.A., Schweller, R.T., Summers, S.M., Woods, D.: The two-handed tile assembly model is not intrinsically universal. Algorithmica 74(2), 812–850 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Derakhshandeh, Z., Gmyr, R., Strothmann, T., Bazzi, R., Richa, A.W., Scheideler, C.: Leader election and shape formation with self-organizing programmable matter. In: Phillips, A., Yin, P. (eds.) DNA 2015. LNCS, vol. 9211, pp. 117–132. Springer, Cham (2015). Scholar
  5. 5.
    Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of the 53rd Conference on Foundations of Computer Science, FOCS 2012 (2012)Google Scholar
  6. 6.
    Goles, E., Maldonado, D., Montealegre, P., Ollinger, N.: On the computational complexity of the freezing non-strict majority automata. In: Dennunzio, A., Formenti, E., Manzoni, L., Porreca, A.E. (eds.) AUTOMATA 2017. LNCS, vol. 10248, pp. 109–119. Springer, Cham (2017). Scholar
  7. 7.
    Goles, E., Ollinger, N., Theyssier, G.: Introducing freezing cellular automata. In: Cellular Automata and Discrete Complex Systems, AUTOMATA 2015, vol. 24, pp. 65–73 (2015)Google Scholar
  8. 8.
    Jonaska, N., Karpenko, D.: Active tile self-assembly, part 2: self-similar structures and structural recursion. Int. J. Found. Comput. Sci. 25(02), 165–194 (2014)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Kari, J.: Theory of cellular automata: a survey. Theor. Comput. Sci. 334(1), 3–33 (2005)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Padilla, J.E., et al.: Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. Int. J. Found. Comput. Sci. 25, 459 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Padilla, J.E., Sha, R., Kristiansen, M., Chen, J., Jonoska, N., Seeman, N.C.: A signal-passing DNA-strand-exchange mechanism for active self-assembly of DNA nanostructures. Angew. Chem. Int. Ed. 54(20), 5939–5942 (2015)CrossRefGoogle Scholar
  12. 12.
    Woods, D., Chen, H.-L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: Innovations in Theoretical Computer Science, ITCS 2013, pp. 353–354 (2013)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Cameron Chalk
    • 1
  • Austin Luchsinger
    • 2
  • Eric Martinez
    • 2
  • Robert Schweller
    • 2
  • Andrew Winslow
    • 2
  • Tim Wylie
    • 2
    Email author
  1. 1.Department of Electrical and Computer EngineeringUniversity of Texas at AustinAustinUSA
  2. 2.Department of Computer ScienceUniversity of Texas Rio Grande ValleyEdinburgUSA

Personalised recommendations