Author:
Ratoandromanana Bodonirina,Robilliard Denis
Reference15 articles.
1. Danièle Beauquier. An undecidable problem about rationnal sets and contour words of polyominoes. Information Processing Letters, 37:257–263, 1991.
2. Danièle Beauquier, Michel Latteux, and Karine Slowinski. A decidability result about convex polyominoes. In Lecture Notes in Computer Science, volume 583, pages 32–45, 1992.
3. Danièle Beauquier and Maurice Nivat. Tiling pictures of the plane with two bars, a horizontal and a vertical one. Technical Report LITP 91.67, LITP, November 1991.
4. Franz J. Brandenburg and Jürgen Dassow. Efficient reductions of picture words. Theoretical Informatics and Applications, 27(4):49–56, 1993.
5. Jürgen Dassow. Graph-theoretical properties and chain code picture languages. J. Inf. Process. Cybern., EIK 25:423–433, 1989.