On the tiling system recognizability of various classes of convex polyominoes
From MaRDI portal
Publication:659791
DOI10.1007/s00026-009-0018-9zbMath1233.05086OpenAlexW2067379346MaRDI 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
Combinatorics in computer science (68R05) Combinatorics on words (68R15) Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50) Combinatorial complexity of geometric structures (52C45)
Related Items (3)
Unnamed Item ⋮ Recognizable Picture Languages and Polyominoes ⋮ On the generation of convex polyominoes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: On the tiling system recognizability of various classes of convex polyominoes
