Angluin's theorem for indexed families of r.e. sets and applications

We extend Angluin s theorem to char acterize identi ability of indexed families of r e languages as opposed to indexed families of recursive languages We also prove some variants characterizing conservativity and two other similar restrictions paralleling Zeug mann Lange and Kapur s results for indexed families of recursive languages

[1]  S. Kapur.  Computational Learning of Languages , 1992 .

[2]  Robert Cedergren,et al.  Guided tour , 1990, Nature.

[3]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

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

[5]  Mark A. Fulk.  Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

[6]  T. Zeugmann.  Characterizations of Class Preserving Monotonic and Dual Monotonic Language Learning , 1992 .

[7]  Thomas Zeugmann,et al.  A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.

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

[9]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[10]  Thomas Zeugmann,et al.  Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..

[11]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[12]  Frank Stephan,et al.  Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity , 1995, Inf. Comput..

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

[14]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[15]  Masako Sato,et al.  Properties of Language Classes with Finite Elasticity , 1995, IEICE Trans. Inf. Syst..

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

[17]  Takeshi Shinohara,et al.  The correct definition of finite elasticity: corrigendum to identification of unions , 1991, COLT '91.

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

[19]  E. Mark Gold,et al.  Limiting recursion , 1965, Journal of Symbolic Logic.

[20]  Arun Sharma,et al.  On Monotonic Strategies for Learning r.e. Languages , 1994, AII/ALT.

[21]  金沢 誠.  Learnable classes of categorial grammars , 1994 .

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