Characterization of Finite Identification

A majority of studies on inductive inference of formal languages and models of logic programming have mainly used Gold's identification in the limit as a correct inference criterion. In this criterion, we can not decide in general whether the inference terminates or not, and the results of the inference necessarily involve some risks. In this paper, we deal with finite identification for a class of recursive languages. The inference machine produces a unique guess just once when it is convinced the termination of the inference, and the results do not. involve any risks at all. We present necessary and sufficient conditions for a class of recursive languages to be finitely identifiable from positive or complete data. We also present some classes of recursive languages that are finitely identifiable from positive or complete data.

[1]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[2]  Dana Angluin,et al.  Finding patterns common to a set of strings (Extended Abstract) , 1979, STOC.

[3]  Takeshi Shinohara.  Inductive inference from positive data is powerful , 1990, COLT '90.

[4]  Keith Wright.  Identification of unions of languages drawn from an identifiable class , 1989, COLT '89.

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

[6]  Rolf Wiehagen,et al.  Research in the theory of inductive inference by GDR mathematicians - A survey , 1980, Inf. Sci..

[7]  Yasuhito Mukouchi,et al.  Characterization of pattern languages , 1991, International Conference on Algorithmic Learning Theory.

[8]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[9]  Ehud Shapiro,et al.  Inductive Inference of Theories from Facts , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[10]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[11]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[12]  Rolf Wiehagen,et al.  Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..

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

[14]  Klaus P. Jantke,et al.  Combining Postulates of Naturalness in Inductive Inference , 1981, J. Inf. Process. Cybern..