Gold-Style Learning Theory
From MaRDI portal
Publication:2963592
DOI10.1007/978-3-662-48395-4_1zbMath1404.68056OpenAlexW2483476736MaRDI QIDQ2963592
Publication date: 15 February 2017
Published in: Topics in Grammatical Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_1
Computational learning theory (68Q32) Memory and learning in psychology (91E40) Grammars and rewriting systems (68Q42)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- A machine discovery from amino acid sequences by decision trees over regular patterns
- Automatic learning of subclasses of pattern languages
- Polynomial-time inference of arbitrary pattern languages
- Note on a central lemma for learning theory
- Prudence and other conditions on formal language learning
- When unlearning helps
- Finding patterns common to a set of strings
- Learning elementary formal systems
- Incremental learning from positive data
- The synthesis of language learners.
- Incremental concept learning for bounded data mining.
- Generality's price: Inescapable deficiencies in machine-learned programs
- Results on memory-limited U-shaped learning
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Variations on U-shaped learning
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- The Power of Vacillation in Language Learning
- Infinitary self-reference in learning theory
- Criteria of language learning
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Language identification in the limit
This page was built for publication: Gold-Style Learning Theory
