Recognizable Picture Languages and Polyominoes
From MaRDI portal
Publication:3522865
DOI10.1007/978-3-540-75414-5_10zbMath1148.68396OpenAlexW2394898374MaRDI QIDQ3522865
Roberto Vaglica, Giuseppa Castiglione
Publication date: 4 September 2008
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_10
Related Items (2)
Cites Work
- On the tiling system recognizability of various classes of convex polyominoes
- Reconstructing convex polyominoes from horizontal and vertical projections
- Reconstruction of convex 2D discrete sets in polynomial time
- A method for the enumeration of various classes of column-convex polygons
- The number of convex polyominoes reconstructible from their orthogonal projections
- Combinatorial aspects of \(L\)-convex polyominoes
- 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
- Unnamed Item
This page was built for publication: Recognizable Picture Languages and Polyominoes