Polynomial Time Algorithm for Inferring Subclasses of Parallel Internal Column Contextual Array Languages

被引：1
|
作者：
Midya, Abhisek [1 ]
Thomas, D. G. [2 ]
Pani, Alok Kumar [3 ]
Malik, Saleem [1 ]
Bhatnagar, Shaleen [1 ]
机构：
[1] Alliance Univ, Informat Technol, Bangalore 562106, Karnataka, India
[2] Madras Christian Coll, Dept Math, Madras 600059, Tamil Nadu, India
[3] Christ Univ, Fac Engn, Comp Sci & Engn, Bangalore 560074, Karnataka, India
来源：
COMBINATORIAL IMAGE ANALYSIS, IWCIA 2017 | 2017年 / 10256卷
关键词：
Parallel internal column contextual array grammars; k-uniform; Identification in the limit from positive data; GRAMMARS;
D O I：
10.1007/978-3-319-59108-7_13
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In [2,16] a new method of description of pictures of digitized rectangular arrays is introduced based on contextual grammars, called parallel internal contextual array grammars. In this paper, we pay our attention on parallel internal column contextual array grammars and observe that the languages generated by these grammars are not inferable from positive data only. We define two subclasses of parallel internal column contextual array languages, namely, k-uniform and strictly parallel internal column contextual languages which are incomparable and not disjoint classes and provide identification algorithms to learn these classes.
引用
收藏
页码：156 / 169
页数：14
相关论文
共 23 条
  • [1] Inferring subclasses of contextual languages
    Emerald, JD
    Subramanian, KG
    Thomas, DG
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 65 - 74
  • [2] On inferring subclasses of internal contextual languages from positive data
    Emerald, JD
    Subramanian, KG
    Thomas, DG
    IMAGE ANALYSIS IN MATERIALS AND LIFE SCIENCES, 2001, : 55 - 60
  • [3] 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
  • [4] Parallel Contextual Hexagonal Array Grammars and Languages
    Thomas, D. G.
    Begam, M. H.
    David, N. G.
    COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2009, 5852 : 344 - 357
  • [5] Inferring grammars for mildly context sensitive languages in polynomial-time
    Oates, Tim
    Armstrong, Tom
    Bonache, Leonor Becerra
    Atamas, Mike
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 137 - 147
  • [6] A LOGARITHMIC BOOLEAN TIME ALGORITHM FOR PARALLEL POLYNOMIAL DIVISION
    BINI, D
    PAN, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 227 : 246 - 251
  • [7] A LOGARITHMIC BOOLEAN TIME ALGORITHM FOR PARALLEL POLYNOMIAL DIVISION
    BINI, D
    PAN, VY
    INFORMATION PROCESSING LETTERS, 1987, 24 (04) : 233 - 237
  • [8] Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
    Department of Computer Science, University of Nevada, Las Vegas, NV 89154-4019, United States
    不详
    不详
    Theor Comput Sci, 1-2 (189-201):
  • [9] Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages
    Larmore, LL
    Rytter, W
    THEORETICAL COMPUTER SCIENCE, 1998, 197 (1-2) : 189 - 201
  • [10] A polynomial-time parsing algorithm for K-depth languages
    Cherubini, A
    SanPietro, P
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 52 (01) : 61 - 79
123