RECOGNIZABLE PICTURE LANGUAGES AND DOMINO TILING

Citation
M. Latteux et D. Simplot, RECOGNIZABLE PICTURE LANGUAGES AND DOMINO TILING, Theoretical computer science, 178(1-2), 1997, pp. 275-283
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
ISSN journal
03043975
Volume
178
Issue
1-2
Year of publication
1997
Pages
275 - 283
Database
ISI
SICI code
0304-3975(1997)178:1-2<275:RPLADT>2.0.ZU;2-L
Abstract
In [2], Giammarresi and Restive define the notion of local picture lan guages by giving a set of authorized 2 x 2 tiles over Sigma boolean OR {#} where # is a boundary symbol which surrounds the pictures. Then th ey define the class of recognizable picture languages as the set of la nguages which can be obtained by projection of a local one. This class is of interest since it admits several quite different characterizati ons [3]. Here, we define the hv-local picture languages where 2 x 2 ti les are replaced by horizontal and vertical dominoes. So the horizonta l and the vertical scanning can be done separately. However, we prove that every recognizable picture language can be obtained as a projecti on of a hv-local language.