On the tiling system recognizability of various classes of convex polyominoes

DOI10.1007/s00026-009-0018-9zbMath1233.05086MaRDI QIDQ659791

F. De Carli, Simone Rinaldi, Andrea Frosini, Laurent Vuillon

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-009-0018-9

zbMATH Keywords

generating functions; convex polyominoes; two-dimensional languages; tiling systems

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

68R15: Combinatorics on words

05B45: Combinatorial aspects of tessellation and tiling problems

05B50: Polyominoes

52C45: Combinatorial complexity of geometric structures

Related Items

Unnamed Item, On the generation of convex polyominoes, Recognizable Picture Languages and Polyominoes

Cites Work

• Analytic models and ambiguity of context-free languages
• Some properties of two-dimensional on-line tessellation acceptors
• Algebraic languages and polyominoes enumeration
• Haruspicy and anisotropic generating functions
• The site-perimeter of bargraphs
• Walks confined in a quadrant are not always D-finite
• Monadic second-order logic over rectangular pictures and recognizability by tiling systems
• A method for the enumeration of various classes of column-convex polygons
• Difference equations in statistical mechanics. II: Solid-on-solid models in two dimensions.
• Indicators of solvability for lattice models
• Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
• Enumeration of L-convex polyominoes by rows and columns
• Reconstruction of L-convex Polyominoes
• Discrete Geometry for Computer Imagery
• Machines, Computations, and Universality
• Checker Boards and Polyominoes
• Unnamed Item
• Unnamed Item
• Unnamed Item