On the complexity of consistent identification of some classes of structure languages

被引：0
|
作者：
Florêncio, CC [1 ]
机构：
[1] Univ Utrecht, UiL OTS, NL-3512 JK Utrecht, Netherlands
来源：
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS | 2000年 / 1891卷
关键词：
identification in the limit; inductive inference; consistent learning; complexity of learning; classical categorial grammar;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In [5,7] 'discovery procedures' for CCGs were defined that accept a sequence of structures as input and yield a set of grammars. In [11] it was shown that some of the classes based on these procedures are learnable. The complexity of learning them was still left open. In this paper it is shown that learning some of these classes is NP-hard under certain restrictions.
引用
收藏
页码：89 / 102
页数：14
相关论文
共 50 条
  • [1] TALLY LANGUAGES AND COMPLEXITY CLASSES
    BOOK, RV
    INFORMATION AND CONTROL, 1974, 26 (02): : 186 - 193
  • [2] LANGUAGES THAT CAPTURE COMPLEXITY CLASSES
    IMMERMAN, N
    SIAM JOURNAL ON COMPUTING, 1987, 16 (04) : 760 - 778
  • [3] ON COMPLEXITY CLASSES AND ALGORITHMICALLY RANDOM LANGUAGES
    BOOK, RV
    LUTZ, JH
    WAGNER, KW
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 319 - 328
  • [4] On some classes of splicing languages
    Ceterchi, R
    Martín-Vide, C
    Subramanian, KG
    ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 84 - 105
  • [5] On some classes of splicing languages
    Ceterchi, Rodica
    Martín-Vide, Carlos
    Subramanian, K.G.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 2950 : 84 - 105
  • [6] Reversible Programming Languages Capturing Complexity Classes
    Kristiansen, Lars
    REVERSIBLE COMPUTATION (RC 2020), 2020, 12227 : 111 - 127
  • [7] COMPLEXITY AND DECIDABILITY FOR RESTRICTED CLASSES OF PICTURE LANGUAGES
    KIM, CW
    THEORETICAL COMPUTER SCIENCE, 1990, 73 (03) : 295 - 311
  • [8] REMARK ON TALLY-LANGUAGES AND COMPLEXITY CLASSES
    BOOK, RV
    INFORMATION AND CONTROL, 1979, 43 (02): : 198 - 201
  • [9] COMPLEXITY OF SOME FUNCTIONAL CLASSES
    TOGER, AV
    DOKLADY AKADEMII NAUK SSSR, 1971, 199 (04): : 789 - &
  • [10] LOGICAL COMPLEXITY OF SOME CLASSES OF TREE-LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA
    BUSZKOWSKI, W
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1980, 26 (01): : 41 - 49
12345