On inferring subclasses of internal contextual languages from positive data

被引：0
|
作者：
Emerald, JD [1 ]
Subramanian, KG [1 ]
Thomas, DG [1 ]
机构：
[1] Madras Christian Coll, Dept Math, Tambaram 600059, Chennai, India
来源：
IMAGE ANALYSIS IN MATERIALS AND LIFE SCIENCES | 2001年
关键词：
formal languages; grammatical inference; identification in the limit;
D O I：
暂无
中图分类号：
R318 [生物医学工程];
学科分类号：
0831 ;
摘要：
Contextual languages of Marcus constitute an interesting class of formal languages, in view of their importance in the study of natural languages. In this paper we show that the languages generated by internal contextual grammars are not inferable from positive data only. On the other hand, different subclasses of these languages can be identified in the limit from positive data only. Applications to images described by chain codes are indicated.
引用
收藏
页码：55 / 60
页数：6
相关论文
共 50 条
  • [1] Inferring subclasses of contextual languages
    Emerald, JD
    Subramanian, KG
    Thomas, DG
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 65 - 74
  • [2] Polynomial Time Algorithm for Inferring Subclasses of Parallel Internal Column Contextual Array Languages
    Midya, Abhisek
    Thomas, D. G.
    Pani, Alok Kumar
    Malik, Saleem
    Bhatnagar, Shaleen
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2017, 2017, 10256 : 156 - 169
  • [3] Inferring uniquely terminating regular languages from positive data
    Makinen, E
    INFORMATION PROCESSING LETTERS, 1997, 62 (02) : 57 - 60
  • [4] Polynomial Time Learner for Inferring Subclasses of Internal Contextual Grammars with Local Maximum Selectors
    Midya, Abhisek
    Thomas, D. G.
    Malik, Saleem
    Pani, Alok Kumar
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2017, 2017, 10580 : 174 - 191
  • [5] Inferring pure context-free languages from positive data
    Koshiba, Takeshi
    Makinen, Erkki
    Takada, Yuji
    Acta Cybernetica, 2000, 14 (03): : 469 - 477
  • [6] Characterizations of re languages starting from internal contextual languages
    Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109 Bucureşti, Romania
    不详
    不详
    不详
    不详
    Int J Comput Math, 3-4 (179-197):
  • [7] Characterizations of RE languages starting from internal contextual languages
    Mateescu, A
    Paun, GH
    Rozenberg, G
    Salomaa, A
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1998, 66 (3-4) : 179 - 197
  • [8] Mind change complexity of inferring unbounded unions of pattern languages from positive data
    de Brecht, Matthew
    Yamamoto, Akihiro
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2006, 4264 : 124 - 138
  • [9] On ambiguity in internal contextual languages
    Ilie, L
    MATHEMATICAL AND COMPUTATIONAL ANALYSIS OF NATURAL LANGUAGE, 1998, 45 : 29 - 45
  • [10] Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
    de Brecht, Matthew
    Yamamoto, Akihiro
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 976 - 985
12345