1. Adleman, L.: Towards a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California (2000)
2. Adleman, L., Kari, J., Kari, L., Reishus, D.: On the decidability of self-asssembly of infinite ribbons. In: Proceedings of FOCS 2002, 43rd Annual Symposium on Foundations of Computer Science, pp. 530–537 (2002)
3. Adleman, L., Kari, J., Kari, L., Reishus, D., Sosík, P.: The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM Journal on Computing 38(6), 2356–2381 (2009)
4. Berger, R.: The undecidability of the domino problem. Mem. Amer. Math. Soc. 66 (1966)
5. Durand, B.: The surjectivity problem for 2D Cellular Automata. Journal of Computer and System Sciences 49, 149–182 (1994)