A characterization of recognizable picture languages by tilings by finite sets

被引:24
|
作者
Simplot, D [1 ]
机构
[1] Univ Lille 1, CNRS, UA 369, LIFL, F-59655 Villeneuve Dascq, France
关键词
D O I
10.1016/S0304-3975(98)00328-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
As extension of the Kleene star to pictures, we introduce the operation of tiling. We give a characterization of recognizable picture languages by intersection of tilings by finite sets of pictures. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:297 / 323
页数:27
相关论文
共 50 条
  • [41] RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 520 : 131 - 140
  • [42] Recognizable languages in divisibility monoids
    Droste, M
    Kuske, D
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 246 - 257
  • [43] On recognizable stable trace languages
    Husson, JF
    Morin, R
    [J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 2000, 1784 : 177 - 191
  • [44] RECOGNIZABLE LANGUAGES IN CONCURRENCY MONOIDS
    DROSTE, M
    [J]. THEORETICAL COMPUTER SCIENCE, 1995, 150 (01) : 77 - 109
  • [45] Operations preserving recognizable languages
    Berstel, J
    Boasson, L
    Carton, O
    Petazzoni, B
    Pin, JE
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 343 - 354
  • [46] Recognizable languages of arrows and cospans
    Bruggink, H. J. Sander
    Koenig, Barbara
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2018, 28 (08) : 1290 - 1332
  • [47] On recognizable infinite array languages
    Gnanasekaran, S
    Dare, VR
    [J]. COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 209 - 218
  • [48] Subclasses of recognizable trace languages
    Reineke, H
    [J]. APPLICATION AND THEORY OF PETRI NETS 1995, 1995, 935 : 357 - 373
  • [50] SOME NOTES ON FINITE-STATE PICTURE LANGUAGES
    ROSENFELD, A
    [J]. INFORMATION AND CONTROL, 1976, 31 (02): : 177 - 184