On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data
暂无分享,去创建一个
[1] Frank Stephan,et al. On the amount of nonconstructivity in learning formal languages from text , 2020 .
[2] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[3] Thomas Zeugmann,et al. Types of monotonic language learning and their characterization , 1992, COLT '92.
[4] S. N. Sivanandam,et al. Theory of Computation , 2009 .
[5] Rusins Freivalds,et al. On the Amount of Nonconstructivity in Learning Recursive Functions , 2011, TAMC.
[6] Thomas Zeugmann,et al. A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.
[7] Robert H. Sloan,et al. BOOK REVIEW: "SYSTEMS THAT LEARN: AN INTRODUCTION TO LEARNING THEORY, SECOND EDITION", SANJAY JAIN, DANIEL OSHERSON, JAMES S. ROYER and ARUN SHARMA , 2001 .
[8] Petr Hájek,et al. Mathematical Foundations of Computer Science 1995 , 1995, Lecture Notes in Computer Science.
[9] Borivoj Melichar,et al. Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.
[10] Jan Krajícek,et al. Consequences of the provability of NP ⊆ P/poly , 2007, J. Symb. Log..
[11] Olaf Beyersdorff,et al. Proof systems that take advice , 2011, Inf. Comput..
[12] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[13] Rusins Freivalds,et al. Co-Learning of Recursive Languages from Positive Data , 1996, Ershov Memorial Conference.
[14] Markus Holzer,et al. Automata That Take Advice , 1995, MFCS.
[15] Rolf Wiehagen,et al. Learning languages and functions by erasing , 2000, Theor. Comput. Sci..
[16] Steffen Lange,et al. Algorithmic Learning for Knowledge-Based Systems , 1995, Lecture Notes in Computer Science.
[17] Dana Angluin,et al. Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..
[18] Klaus P. Jantke. Monotonic and non-monotonic inductive inference , 2009, New Generation Computing.
[19] Manfred Broy,et al. Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.
[20] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[21] P. Erdös. Some remarks on the theory of graphs , 1947 .
[22] Thomas Zeugmann,et al. Learning indexed families of recursive languages from positive data: A survey , 2008, Theor. Comput. Sci..
[23] Thomas Zeugmann,et al. Language learning in dependence on the space of hypotheses , 1993, COLT '93.
[24] Rusins Freivalds,et al. Amount of Nonconstructivity in Finite Automata , 2009, CIAA.
[25] Rusins Freivalds,et al. Amount of nonconstructivity in deterministic finite automata , 2010, Theor. Comput. Sci..
[26] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..