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 条

[31] Inferring contextual field interactions from scalp EEG
Pflieger, ME
BEHAVIORAL AND BRAIN SCIENCES, 2003, 26 (01) : 99 - +
[32] Learning languages from positive data and a limited number of short counterexamples
Jain, Sanjay
Kinber, Efim
THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 190 - 218
[33] Some classes of regular languages identifiable in the limit from positive data
Denis, F
Lemay, A
Terlutte, A
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLIICATIONS, 2002, 2484 : 63 - 76
[34] On learning languages from positive data and a limited number of short counterexamples
Jain, Sanjay
Kinber, Efim
LEARNING THEORY, PROCEEDINGS, 2006, 4005 : 259 - 273
[35] Inductive inference of unbounded unions of pattern languages from positive data
Shinohara, T
Arimura, H
THEORETICAL COMPUTER SCIENCE, 2000, 241 (1-2) : 191 - 209
[36] Learning locally testable even linear languages from positive data
Sempere, JM
García, P
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2002, 2484 : 225 - 236
[37] Learning indexed families of recursive languages from positive data: A survey
Lange, Steffen
Zeugmann, Thomas
Zilles, Sandra
THEORETICAL COMPUTER SCIENCE, 2008, 397 (1-3) : 194 - 232
[38] Learning Analysis by Reduction from Positive Data Using Reversible Languages
Hoffmann, Petr
SEVENTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2008, : 141 - 146
[39] Inductive inference of unbounded unions of pattern languages from positive data
Lect Notes Artif Intell, (256):
[40] INFERRING INTERNAL REPRESENTATIONS FROM MOVE SEQUENCES
ERICSSON, KA
BULLETIN OF THE PSYCHONOMIC SOCIETY, 1979, 14 (04) : 238 - 238

← 1 2 3 4 5 →