Tiling the plane with one tile
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A method for the enumeration of various classes of column-convex polygons
Discrete Mathematics
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Handbook of formal languages, vol. 3
Reconstruction of convex 2D discrete sets in polynomial time
Theoretical Computer Science
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
On Some Recognizable Picture-Languages
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Piecewise Testable, Starfree, and Recognizable Picture Languages
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Enumeration of L-convex polyominoes by rows and columns
Theoretical Computer Science
Combinatorial aspects of L-convex polyominoes
European Journal of Combinatorics
Ordering and convex polyominoes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A tomographical characterization of l-convex polyominoes
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
From linear partitions to parallelogram polyominoes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Online tessellation automaton recognizing various classes of convex polyominoes
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
A tiling system for the class of L-convex polyominoes
Theoretical Computer Science
| Hi-index | 0.00 |
We consider the problem of recognizability of some classes of polyominoes in the theory of picture languages. In particular we focus our attention on the problem posed by Matz of finding a nonrecognizable picture language for which his technique for proving the non-recognizability of picture languages fails. We face the problem by studying the family of L-convex polyominoes and some closed families that are similar to the recognizable family of all polyominoes but result to be non-recognizable. Furthermore we prove that the family of L-convex polyominoes satisfies the necessary condition given by Matz for the recognizability and we conjecture that the family of L-convex polyominoes is non-recognizable.