Part of the Lecture Notes in Computer Science book series (LNCS, volume 8553)
Scaled Tree Fractals Do not Strictly Self-assemble
In this paper, we show that any scaled-up version of any discrete self-similar tree fractal does not strictly self-assemble, at any temperature, in Winfree’s abstract Tile Assembly Model.
KeywordsAssembly Sequence Tree Fractal Tile Type Grid Graph Southwest Corner
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 5.Meunier, P.-E., Patitz, M.J., Summers, S.M., Theyssier, G., Winslow, A., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 752–771 (2014)Google Scholar
- 7.Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)Google Scholar
- 10.Wang, H.: Proving theorems by pattern recognition – II. The Bell System Technical Journal XL(1), 1–41 (1961)Google Scholar
- 11.Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)Google Scholar
© Springer International Publishing Switzerland 2014