论文信息 - A family of languages which is polynomial-time learnable from positive data in pitt's sense

A family of languages which is polynomial-time learnable from positive data in pitt's sense

This note shows that there exists a non-trivial class of languages fulfilling the condition “polynomial-time learnability in the limit” in the original strong sense of Pitt.

Erkki Mäkinen

[1] Erkki Mäkinen. The Grammatical Inference Problem for the Szilard Languages of Linear Grammars , 1990, Inf. Process. Lett..

[2] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[3] Leonard Pitt,et al. Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[4] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.

[5] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..