Recognizable picture languages and domino tiling

被引:37
|
作者
Latteux, M [1 ]
Simplot, D [1 ]
机构
[1] UNIV LILLE 1, CNRS, UA 369, LIFL, F-59655 VILLENEUVE DASCQ, FRANCE
关键词
D O I
10.1016/S0304-3975(96)00283-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In [2], Giammarresi and Restive define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over Sigma boolean OR{#} 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 [3]. 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.
引用
收藏
页码:275 / 283
页数:9
相关论文
共 50 条
  • [41] On recognizable infinite array languages
    Gnanasekaran, S
    Dare, VR
    COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 209 - 218
  • [42] Domino Tiling Congruence Modulo 4
    Tenner, Bridget Eileen
    GRAPHS AND COMBINATORICS, 2009, 25 (04) : 625 - 638
  • [43] DOMINO TILING IN BIREGULAR PLANAR GRAPHS
    CHABOUD, T
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1994, 318 (06): : 591 - 594
  • [44] Domino Tiling Congruence Modulo 4
    Bridget Eileen Tenner
    Graphs and Combinatorics, 2009, 25 : 625 - 638
  • [45] An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded
    Thiant, N
    THEORETICAL COMPUTER SCIENCE, 2003, 303 (2-3) : 353 - 374
  • [46] A SURVEY OF RECOGNIZABLE LANGUAGES OF INFINITE TRACES
    GASTIN, P
    PETIT, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 609 : 392 - 409
  • [47] On Subclasses of Recognizable ?? - Partial Array Languages
    Muhiuddin, G.
    Janaki, K.
    Al-Kadi, D.
    Arulprakasam, R.
    Govindan, V.
    JOURNAL OF MATHEMATICS, 2022, 2022
  • [48] On logically defined recognizable tree languages
    Ésik, Z
    Weil, P
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 195 - 207
  • [49] ZETA-FUNCTIONS OF RECOGNIZABLE LANGUAGES
    BERSTEL, J
    REUTENAUER, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 93 - 104
  • [50] Hitting Matrix and Domino Tiling with Diagonal Impurities
    Nakano, Fumihiko
    Sadahiro, Taizo
    JOURNAL OF STATISTICAL PHYSICS, 2013, 151 (06) : 1035 - 1055