On the tiling system recognizability of various classes of convex polyominoes

Annals of Combinatorics

Volumn 13, Issue 2, 2009, Pages 169-191

  de Carli, F ^a   Frosini, A ^a   Rinaldi, S ^a   Vuillon, L ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITÉ DE SAVOIE   (France)

Author keywords

Convex polyominoes; Generating functions; Tiling systems; Two dimensional languages

Indexed keywords

EID: 70349900490     PISSN: 02180006     EISSN: 02193094     Source Type: Journal    
DOI: 10.1007/s00026-009-0018-9     Document Type: Article

References (26)

1. D. Beauquier and M. Nivat, Tiling the plane with one tile, In: Proc. of The 6th Annual Symposium on Computational geometry (SGC'90), ACM press, Berkeley, (1990) pp. 128-138.
2. Bousquet-Mélou M.: A method for the enumeration of various classes of column-convex polygons. Discrete Math. 154(1-3), 1-25 (1996).
3. Bousquet-Mélou M., Petkovšek M.: Walks confined in a quadrant are not always D-finite. Theoret. Comput. Sci. 307(2), 257-276 (2003).
4. Bousquet-Mélou M., Rechnitzer A.: The site-perimeter of bargraphs. Adv. Appl.Math. 31(1), 86-112 (2003).
5. G. Castiglione, A. Frosini, E. Munarini, A. Restivo, and S. Rinaldi, Enumeration of L-convex polyominoes II. Bijection and area, In: 17th Formal Power Series and Algebraic Combinatorics, Taormina, Italy, 2005.
6. G. Castiglione, A. Frosini, A. Restivo, and S. Rinaldi, A tomographical characterization of L-convex polyominoes, In: Proceedings of Discrete Geometry for Computer Imagery 12th International Conference, Lecture Notes in Comput. Sci., Vol. 3429, Springer, Berlin, (2005) pp. 115-125.
7. Castiglione G., Frosini A., Restivo A., Rinaldi S.: Enumeration of L-convex polyominoes by rows and columns. Theoret. Comput. Sci. 347(1-2), 336-352 (2005).
8. Castiglione G., Restivo A.: Reconstruction of L-convex Polyominoes. Electron. Notes Discrete Math. 12, 290-301 (2003).
9. G. Castiglione and A. Restivo, Ordering and convex polyominoes, In: Proceedings of Machines, Computations, and Universality, Lecture Notes in Comput. Sci., Vol. 3354, Springer-Verlag, Berlin, (2005) pp. 128-139.
10. N. Chomsky and M.P. Schützenberger, The algebraic theory of context-free languages, In: Computer Programming and Formal Systems, P. Braffort and D. Hirschberg, Eds., North-Holland, Amsterdam, (1963) pp. 118-161.
11. Delest M., Viennot X.: Algebraic languages and polyominoes enumeration. Theoret. Comput. Sci. 34(1-2), 169-206 (1984).
12. Flajolet P.: Analytic models and ambiguity of context-free languages. Theoret. Comput. Sci. 49(2-3), 283-309 (1987).
13. M. Gardner, Mathematical games, Scientific American, (1958) September 182-192; November 136-142.
14. de Gennes P.G.: Scaling Concepts in Polymers Physics. Cornell University Press, New York (1979).
15. D. Giammarresi and A. Restivo, Two-dimensional languages, In: Handbook of Formal Languages, Vol. 3, A. Salomaa and G. Rozenberg, Eds., Springer, Berlin, (1997) pp. 215- 267.
16. Giammarresi D., Restivo A., Seibert S., Thomas W.: Monadic second-order logic over rectangular pictures and recognizability by tiling system. Inform. and Comput. 125(1), 32-45 (1996).
17. Golomb S.W.: Polyominoes: Puzzles, Patterns, Problems, and Packings, 2nd Ed. Princeton Academic Press, Princeton (1996).
18. Golomb S.W.: Checker boards and polyominoes. Amer. Math. Monthly 61(10), 675-682 (1954).
19. Guttmann A.J.: Indicators of solvability for lattice models. Discrete Math. 217(1-3), 167-189 (2000).
20. K. Inoue and I. Takanami, A survey of two-dimensional automata theory, In: Lecture Notes in Comput. Sci., Vol. 381, Springer, Berlin, (1989) pp. 72-91.
21. Inoue K., Nakamura A.: Some properties on two-dimensional on-line tessellation acceptors. Inform. Sci. 13(2), 95-121 (1977).
22. K. Inoue and I. Takanami, A characterization of recognizable picture languages, In: Lecture Notes in Comput. Sci., Vol. 654, Springer-Verlag, Berlin, (1992) pp. 133-143.
23. Privman V., Švrakić N.M.: Difference equations in statistical mechanics. II. Solid-onsolid models in two dimensions. J. Statist. Phys. 51(5-6), 1111-1126 (1988).
24. Rechnitzer A.: Haruspicy and anisotropic generating functions. Adv. Appl. Math. 30(1-2), 228-257 (2003).
25. Rechnitzer A.: Haruspicy 2: the self-avoiding polygon generating function is not D-finite. J. Combin. Theory Ser. A 113(3), 520-546 (2006).
26. Stanley R.P.: Enumerative Combinatorics, Vol. 2. Cambridge University Press, Cambridge (1999).