LOCAL PICTURE LANGUAGES

被引：0
|
作者：
COLLARD, RFA [1 ]
机构：
[1] CATHOLIC UNIV NIJMEGEN,NIJMEGEN,NETHERLANDS
来源：
COMPUTER GRAPHICS AND IMAGE PROCESSING | 1981年 / 17卷 / 04期
关键词：
D O I：
10.1016/0146-664X(81)90012-5
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：332 / 344
页数：13
相关论文
共 50 条
  • [41] Jorge!Semprun and the overlapping of languages:: The picture and the screen
    Durán, MAS
    ESPRIT CREATEUR, 2004, 44 (02): : 18 - 28
  • [42] ON THE CONNECTEDNESS OF PICTURES IN CHAIN CODE PICTURE LANGUAGES
    DASSOW, J
    THEORETICAL COMPUTER SCIENCE, 1991, 81 (02) : 289 - 294
  • [43] The finiteness of synchronous, tabled picture languages is decidable
    Truthe, Bianca
    THEORETICAL COMPUTER SCIENCE, 2006, 366 (03) : 297 - 315
  • [44] AUTOMATA WITH CYCLIC MOVE OPERATIONS FOR PICTURE LANGUAGES
    Otto, Friedrich
    Mraz, Frantisek
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2018, 52 (2-4): : 235 - 251
  • [45] Learning Picture Languages Using Dimensional Reduction
    Kubon, David
    Mraz, Frantisek
    Rychtera, Ivan
    INTELIGENCIA ARTIFICIAL-IBEROAMERICAL JOURNAL OF ARTIFICIAL INTELLIGENCE, 2023, 26 (71): : 59 - 74
  • [46] Symbolic picture languages and their decidability and complexity properties
    Costagliola, G
    Ferrucci, F
    JOURNAL OF VISUAL LANGUAGES AND COMPUTING, 1999, 10 (04): : 381 - 419
  • [47] Deterministic ordered restarting automata for picture languages
    Otto, Friedrich
    Mraz, Frantisek
    ACTA INFORMATICA, 2015, 52 (7-8) : 593 - 623
  • [48] COMPLEXITY AND DECIDABILITY FOR CHAIN CODE PICTURE LANGUAGES
    SUDBOROUGH, IH
    WELZL, E
    THEORETICAL COMPUTER SCIENCE, 1985, 36 (2-3) : 173 - 202
  • [49] Types of P System and Triangular Picture Languages
    Bhuvaneswari, K.
    Kalyani, T.
    2018 1ST INTERNATIONAL CONFERENCE ON COMPUTER APPLICATIONS & INFORMATION SECURITY (ICCAIS' 2018), 2018,
  • [50] On piecewise testable, starfree, and recognizable picture languages
    Matz, O
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, 1998, 1378 : 203 - 210
12345