M. Anselmo, D. Giammarresi, M. Madonia, and A. , Restivo Unambiguous Recognizable two-dimensional languages. RAIRO -Inf, Teor. Appl, vol.40, pp.277-293, 2006.
DOI : 10.1051/ita:2006008

R. Barish, P. Rothemund, and E. Winfree, Two Computational Primitives for Algorithmic Self-Assembly:?? Copying and Counting, Nano Letters, vol.5, issue.12, pp.2586-2592, 2005.
DOI : 10.1021/nl052038l

D. Beauquier and M. Nivat, On translating one polyomino to tile the plane, Discrete & Computational Geometry, vol.62, issue.4, pp.575-592, 1991.
DOI : 10.1007/BF02574705

D. Beauquier and M. Nivat, Tiling the plane with one tile, Proc. of the 6th Annual Symposium on Computational geometry (SGC'90), pp.128-138, 1990.

M. Blum and C. Hewitt, Automata on a two-dimensional tape, IEEE Symposium on Switching and Automata Theory, pp.155-160, 1967.

M. Bousquet-mélou, A method for the enumeration of various classes of column-convex polygons, Discrete Mathematics, vol.154, issue.1-3, pp.1-25, 1996.
DOI : 10.1016/0012-365X(95)00003-F

M. Bousquet-mélou and M. Petkovsek, Walks confined in a quadrant are not always D-finite, Theoretical Computer Science, vol.307, issue.2, pp.257-276, 2003.
DOI : 10.1016/S0304-3975(03)00219-6

M. Bousquet-mélou and A. Rechnitzer, The site-perimeter of bargraphs, Advances in Applied Mathematics, vol.31, issue.1, pp.31-86, 2003.
DOI : 10.1016/S0196-8858(02)00553-5

J. R. Büchi, Weak Second-Order Arithmetic and Finite Automata, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.9, issue.1-6, pp.66-92, 1960.
DOI : 10.1002/malq.19600060105

G. Castiglione, A. Frosini, E. Munarini, A. Restivo, and S. Rinaldi, Enumeration of L-convex polyominoes II. Bijection and area, Proceedings of Formal Power Series and Algebraic Combinatorics, pp.20-26, 2005.

G. Castiglione, A. Frosini, A. Restivo, and S. Rinaldi, A Tomographical Characterization of L-Convex Polyominoes, Proceedings of Discrete Geometry for Computer Imagery 12th International Conference, DGCI 2005, pp.115-125
DOI : 10.1007/978-3-540-31965-8_11

G. Castiglione, A. Frosini, A. Restivo, and S. Rinaldi, Enumeration of L-convex polyominoes by rows and columns, Theoretical Computer Science, vol.347, issue.1-2, pp.336-352, 2005.
DOI : 10.1016/j.tcs.2005.06.031

G. Castiglione and A. Restivo, Reconstruction of L-convex Polyominoes, Electronic Notes in Discrete Mathematics, vol.12, 2003.
DOI : 10.1016/S1571-0653(04)00494-9

G. Castiglione and A. Restivo, Ordering and Convex Polyominoes, Machines , Computations, and Universality, 4th International Conference, 2005.
DOI : 10.1007/978-3-540-31834-7_10

J. Cervelle, Langages de Figures Rapport de stage Ecole Normale Supriure de Lyon, 1997.

S. Chaiken, D. J. Kleitman, M. Saks, and J. Shearer, Covering Regions by Rectangles, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.4, pp.394-410, 1981.
DOI : 10.1137/0602042

M. F. Choen, J. Shade, S. Hiller, and O. Deussen, Wang Tiles for image and texture generation, ACM Transaction on Graphics, 2003.

N. Chomsky and M. P. Schützenberger, The algebraic theory of contextfree languages, Computer Programming and Formal Systems, pp.118-161, 1963.

J. H. Conway and J. C. Lagarias, Tiling with polyominoes and combinatorial group theory, Journal of Combinatorial Theory, Series A, vol.53, issue.2, pp.53-183, 1990.
DOI : 10.1016/0097-3165(90)90057-4

S. , C. Reghizzi, and M. , Pradella Tile rewriting grammars, Proc. of the Seventh Internat. Conf. on Developments in Language Theory (DLT 2003), p.206217, 2003.

K. Culik and I. , An aperiodic set of 13 Wang tiles, Discrete Mathematics, vol.160, issue.1-3, pp.245-251, 1996.
DOI : 10.1016/S0012-365X(96)00118-5

M. Daley and L. Kari, DNA Computing: Models and Implementations, Comments??? on Theoretical Biology, vol.7, issue.3, pp.177-198, 2002.
DOI : 10.1080/08948550213852
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3213

F. Carli, A. Frosini, S. Rinaldi, and A. , Sorbi Some remarks on tiling recognizable languages, Pure Mathematics and Applications, vol.16, pp.69-80, 2005.

M. Delest and X. Viennot, Algebraic languages and polyominoes enumeration, Theoretical Computer Science, vol.34, issue.1-2, pp.169-206, 1984.
DOI : 10.1016/0304-3975(84)90116-6

L. De-prophetis and S. Varricchio, Recognizability of rectangular pictures by Wang systems, Journal of Automata, Languages and Combinatorics, vol.2, pp.269-288, 1998.

P. Flajolet, Analytic models and ambiguity of context-free languages, Theoretical Computer Science, vol.49, issue.2-3, pp.283-309, 1987.
DOI : 10.1016/0304-3975(87)90011-9
URL : https://hal.archives-ouvertes.fr/inria-00076071

M. Gardner, Mathematical games, Scientific American, pp.136-142, 1958.
DOI : 10.1038/scientificamerican0157-138

D. Giammarresi and A. Restivo, Recognizable picture languages, Proc. First International Colloquium on Parallel Image Processing, pp.3-241, 1992.

D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas, Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems, Information and Computation, vol.125, issue.1, pp.32-45, 1996.
DOI : 10.1006/inco.1996.0018

D. Giammarresi and A. Restivo, Two-dimensional languages, Handbook of Formal Languages, pp.215-267, 1997.

D. Giammarresi and A. Restivo, Matrix based complexity functions and recognizable picture languages, Logic and Automata, TLG2

D. Girault-beauquier and M. Nivat, Tiling the plane with one tile, Proceedings of the sixth annual symposium on Computational geometry , SCG '90, 1990.
DOI : 10.1145/98524.98553

S. W. Golomb, Checker Boards and Polyominoes, The American Mathematical Monthly, vol.61, issue.10, pp.10-675, 1954.
DOI : 10.2307/2307321

A. J. Guttmann, Indicators of solvability for lattice models, Discrete Mathematics, vol.217, issue.1-3, pp.167-189, 2000.
DOI : 10.1016/S0012-365X(99)00262-9

J. M. Hammersley, Percolation processes II: the connective constant, Proc. Cambridge, pp.642-645, 1957.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.
DOI : 10.1145/568438.568455

K. Inoue and A. Nakamura, Some properties of two-dimensional on-line tessellation acceptors, Information Sciences, vol.13, issue.2, pp.95-121, 1977.
DOI : 10.1016/0020-0255(77)90023-8

K. Inoue and A. Nakamura, Non closure properties of two-dimensional online tessellation acceptors, Transaction of IECE of Japan, pp.475-476, 1977.

K. Inoue and A. Takanami, A Survey of two-dimensional automata theory, Proc. 5th Int. Meeting of Young Computer Scientists, 1993.

I. Jensen, A parallel algorithm for the enumeration of self-avoiding polygons on the square lattice, Journal of Physics A: Mathematical and General, vol.36, issue.21, pp.5731-5745, 2003.
DOI : 10.1088/0305-4470/36/21/304

H. R. Lewis and C. H. Papadimitriou, Elements of the THeory of Computation, 1981.

O. Matz, Regular expressions and context-free grammars for picture languages, Proc. of the 14th Annu, pp.27-283, 1997.
DOI : 10.1007/BFb0023466

O. Matz, On piecewise testable, starfree, and recognizable picture languages, Foundations of Software Science and Computation Struc-tures, Lecture Notes in Comp. Sci. 1378 203-210, 1998.
DOI : 10.1007/BFb0053551

M. Nivat, A. Saoudi, and V. R. , Dare Parallel generation of finite images, International Journal of Pattern Recognition and Artificial Intelligence, vol.3, pp.3-4, 1989.

M. Nivat, A. Saoudi, and V. R. , Parallel generation of infinite images, International Journal of Computer Mathematics, vol.109, issue.1-4, pp.25-42, 1990.
DOI : 10.1080/01969727508545918

V. Privman and N. M. Svrakic, Difference equations in statistical mechanics. I. Cluster statistics models, Journal of Statistical Physics, vol.60, issue.300, pp.1091-1110, 1988.
DOI : 10.1007/BF01014901

A. Rechnitzer, Haruspicy and anisotropic generating functions, Advances in Applied Mathematics, vol.30, issue.1-2, pp.228-257, 2003.
DOI : 10.1016/S0196-8858(02)00534-1

A. Rechnitzer, Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, Journal of Combinatorial Theory, Series A, vol.113, issue.3
DOI : 10.1016/j.jcta.2005.04.010

D. H. Redelmeier, Counting polyominoes: Yet another attack, Discrete Mathematics, vol.36, issue.2, pp.191-203, 1981.
DOI : 10.1016/0012-365X(81)90237-5

K. Reinhardt, On some recognizable picture-languages, Proc. of the 23th MFCS, pp.760-770, 1998.
DOI : 10.1007/BFb0055827

K. Reinhardt, The #a = #b Pictures Are Recognizable, Proc. of the 18th STACS, pp.527-538, 2001.
DOI : 10.1007/3-540-44693-1_46

R. I. Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Omega Series, 1987.

H. N. Temperley, Combinatorial problems suggested by the statistical mechanics of domains and of rubber-like molecules, Phys, pp.103-104, 1956.

W. Thomas, On logics, tilings, and automata, Proc. 18th Int, pp.441-453, 1991.
DOI : 10.1007/3-540-54233-7_154

R. Vaglica, Reconstruction and Recognizability of Polyominoes Ph

E. Winfree, Algorithmic Self-Assembly of DNA: Theoretical Motivations and 2D Assembly Experiments, Proceedings of the Eleventh Conversation, 1999.
DOI : 10.1038/7582

H. Wang, Proving Theorems by Pattern Recognition - II, Bell System Technical Journal, vol.40, issue.1, pp.1-42, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03975.x

H. Wang, Games, logic, and computers, Scientific American November, pp.98-106, 1965.