SUCCINCTNESS OF DIFFERENT REPRESENTATIONS OF LANGUAGES

被引：26
|
作者：
HARTMANIS, J
机构：
来源：
SIAM JOURNAL ON COMPUTING | 1980年 / 9卷 / 01期
关键词：
D O I：
10.1137/0209010
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：114 / 120
页数：7
相关论文
共 50 条
  • [1] Succinctness of Languages for Judgment Aggregation
    Endriss, Ulle
    Grandi, Umberto
    de Haan, Ronald
    Lang, Jerome
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 176 - 185
  • [2] On the Succinctness of Closure Operator Representations
    Rudolph, Sebastian
    FORMAL CONCEPT ANALYSIS, ICFCA 2014, 2014, 8478 : 15 - 36
  • [3] Succinctness of descriptions of SBTA-languages
    Gruska, J
    Monti, A
    Napoli, M
    Parente, D
    THEORETICAL COMPUTER SCIENCE, 1997, 179 (1-2) : 251 - 271
  • [4] NOTE ON SUCCINCTNESS OF DESCRIPTIONS OF DETERMINISTIC LANGUAGES
    VALIANT, LG
    INFORMATION AND CONTROL, 1976, 32 (02): : 139 - 145
  • [5] Succinctness and tractability of closure operator representations
    Rudolph, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2017, 658 : 327 - 345
  • [6] Succinctness of pattern-based schema languages for XML
    Gelade, Wouter
    Neven, Frank
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2011, 77 (03) : 505 - 519
  • [7] Succinctness of pattern-based Schema languages for XML
    Gelade, Wouter
    Neven, Frank
    DATABASE PROGRAMMING LANGUAGES, 2007, 4797 : 201 - +
  • [8] ON GODEL SPEED-UP AND SUCCINCTNESS OF LANGUAGE REPRESENTATIONS
    HARTMANIS, J
    THEORETICAL COMPUTER SCIENCE, 1983, 26 (03) : 335 - 342
  • [9] Comparing the succinctness of monadic query languages over finite trees
    Grohe, M
    Schweikardt, N
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2003, 2803 : 226 - 240
  • [10] Comparing the succinctness of monadic query languages over finite trees
    Grohe, M
    Schweikardt, N
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2004, 38 (04): : 343 - 373
12345