Recognizable picture languages and domino tiling
β Scribed by Michel Latteux; David Simplot
- Book ID
- 104326242
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 466 KB
- Volume
- 178
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
In , Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different characterizations . Here, we define the hv-local picture languages where 2 x 2 tiles are replaced by horizontal and vertical dominoes. So the horizontal and the vertical scanning can be done separately. However, we prove that every recognizable picture language can be obtained as a projection of a hv-local language.
π SIMILAR VOLUMES
We consider the problem of tiling with dominoes pictures of the plane. in theoretical and algorithmic aspects. For generalities and other tiling problems, see for example Refs. Beauquier et al. (1995), Conway and Lagarias (1990). Kannan and Soroker (1992), Kenyon (1992), and Beauquier (1991). The pi
## Abstract In the context of a syntactic approach to pattern recognition, there have been several studies in the last few decades ontheoretical models for generating or recognizing twoβdimensional objects, pictures, and picture languages. Motivated by these studies, we have introduced a new notion