@InProceedings{OneTile_ICALP2014,
AUTHOR = {Erik D. Demaine and Martin L. Demaine and S\'andor P. Fekete and Matthew J. Patitz and Robert T. Schweller and Andrew Winslow and Damien Woods},
TITLE = {One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile},
EDITOR = {J. Esparza and P. Fraigniaud and T. Husfeldt and E. Koutsoupias},
BOOKTITLE = {Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP 2014)},
VOLUME = 8572,
SERIES = {Lecture Notes in Computer Science},
seriesurl = {http://www.springer.de/comp/lncs/},
YEAR = 2014,
PAGES = {368--379},
withstudent = 1,
doi = {https://dx.doi.org/10.1007/978-3-662-43948-7_31},
dblp = {https://dblp.org/rec/conf/icalp/DemaineDFPSWW14},
comments = {This paper is available from <A HREF="https://doi.org/10.1007/978-3-662-43948-7_31">SpringerLink</A>.
The full paper is available as <A HREF="http://arXiv.org/abs/1212.4756">arXiv:1212.4756</A>.},
}
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.