1. D. Beauquier, A Undecidable Problem about Rational Sets and Contour Words of Polyominoes, Information Processing Letters
37 (1991), 257–263.
2. R. Berger, The undecidability of the domino problem, Memoirs Amer. Math. Soc.
66 (1966), 72.
3. D. Beauquier, M. Latteux, K. Slowinski, A decidability result about convex polyominoes, Technical Report I.T. 214 (1991), University of Lille, France.
4. D. Beauquier, M. Nivat, On translating one polyomino to tile the plane, Discrete and Computational Geometry, to appear.
5. J. Dassow, Convexity and Simplicity of Chain Code Picture Languages, Rostock. Math. Kolloq.
34 (1988), 53–60.