One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
Name
paper(1).pdf
Description
Accepted version
Size
286.47 KB
Format
Adobe PDF
Checksum (MD5)
ec5b13ea64c24644bbebddaef5c9eb37
Author(s)
Demaine, Erik D
Demaine, Martin L
Fekete, Sándor P.
Patitz, Matthew J.
Schweller, Robert T.
Winslow, Andrew
Woods, Damien
Date Issued
July 2014
Journal
International Colloquium on Automata, Languages, and Programming
Publisher
Springer
Citation
Demaine, Erik D. et al. "One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile." International Colloquium on Automata, Languages, and Programming, July 2014, Copenhagen, Denmark, Springer, July 2014 © 2014 Springer-Verlag
Version
Author's final manuscript
Abstract
In the classical model of tile self-assembly, unit square tiles translate in the plane and attach edgewise to form large crystalline structures. This model of self-assembly has been shown to be capable of asymptotically optimal assembly of arbitrary shapes and, via information-theoretic arguments, increasingly complex shapes necessarily require increasing numbers of distinct types of tiles. We explore the possibility of complex and efficient assembly using systems consisting of a single tile. Our main result shows that any system of square tiles can be simulated using a system with a single tile that is permitted to flip and rotate. We also show that systems of single tiles restricted to translation only can simulate cellular automata for a limited number of steps given an appropriate seed assembly, and that any longer-running simulation must induce infinite assembly.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-662-43948-7_31
