Robert Berger (1964):
The Undecidability of the Domino Problem.
Harvard University.
Bruno Durand (1999):
Tilings and Quasiperiodicity.
Theoretical Computer Science 221(1-2),
pp. 61–75,
doi:10.1016/S0304-3975(99)00027-4.
Karel Culik II (1996):
An aperiodic set of 13 Wang tiles.
Discrete Mathematics 160,
pp. 245–251,
doi:10.1016/S0012-365X(96)00118-5.
Jarkko Kari (1996):
A small aperiodic set of Wang tiles.
Discrete Mathematics 160,
pp. 259–264,
doi:10.1016/0012-365X(95)00120-L.
Nicolas Ollinger (2009):
Tiling the Plane with a Fixed Number of Polyominoes.
In: Proceedings of the Third International Conference on Language and Automata Theory and Applications (LATA),
LNCS 5457,
pp. 638–647,
doi:10.1007/978-3-642-00982-2_54.
Hao Wang (1961):
Proving theorems by Pattern Recognition II.
Bell Systems technical journal 40,
pp. 1–41.
eptcs@eptcs.org