Learnability of automatic classes
暂无分享,去创建一个
[1] Rolf Wiehagen,et al. Polynomial-time inference of arbitrary pattern languages , 2009, New Generation Computing.
[2] Henning Fernau,et al. Identification of function distinguishable languages , 2000, Theor. Comput. Sci..
[3] Satoshi Kobayashi,et al. Locality, Reversibility, and Beyond: Learning Languages from Positive Data , 1998, ALT.
[4] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[5] Thomas Zeugmann,et al. Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..
[6] Dana Angluin,et al. Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..
[7] Klaus P. Jantke. Monotonic and non-monotonic inductive inference , 2009, New Generation Computing.
[8] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[9] Yasuhito Mukouchi,et al. Characterization of Finite Identification , 1992, AII.
[10] John Case,et al. Automatic Learners with Feedback Queries , 2011, CiE.
[11] Bernard R. Hodgson. On Direct Products of Automaton Decidable Theories , 1982, Theor. Comput. Sci..
[12] Sasha Rubin,et al. Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.
[13] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[14] Thomas Erlebach,et al. Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries , 2001, Theor. Comput. Sci..
[15] Carl H. Smith,et al. On the impact of forgetting on learning machines , 1995, JACM.
[16] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[17] Kenneth Wexler,et al. Formal Principles of Language Acquisition , 1980 .
[18] Tao Jiang,et al. Learning regular languages from counterexamples , 1988, COLT '88.
[19] Leonard Pitt,et al. A polynomial-time algorithm for learning k-variable pattern languages from examples , 1989, COLT '89.
[20] Takeshi Shinohara,et al. Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems , 1994, Inf. Comput..
[21] Rolf Wiehagen. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien , 1975, J. Inf. Process. Cybern..
[22] John Case,et al. Automatic Learning of Subclasses of Pattern Languages , 2011, LATA.
[23] Dana Angluin,et al. Inference of Reversible Languages , 1982, JACM.
[24] Anil Nerode,et al. Automatic Presentations of Structures , 1994, LCC.
[25] Aurélien Lemay,et al. Some Classes of Regular Languages Identifiable in the Limit from Positive Data , 2002, ICGI.
[26] John Case,et al. The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..
[27] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[28] Achim Blumensath,et al. Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).
[29] Frank Stephan,et al. Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity , 1995, Inf. Comput..
[30] Thomas Zeugmann,et al. Language learning in dependence on the space of hypotheses , 1993, COLT '93.