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
来源
关键词
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 条