Characterizations of monotonic and dual monotonic language learning
From MaRDI portal
Publication:1898458
DOI10.1006/inco.1995.1107zbMath0835.68103OpenAlexW2020665696MaRDI QIDQ1898458
Steffen Lange, Thomas Zeugmann, Shyam Kapur
Publication date: 16 April 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e3f9df00340f2209549a7ac8e115d65a985cc7c6
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Generalized notions of mind change complexity, On the classification of computable languages, On the data consumption benefits of accepting increased uncertainty, Inductive inference and reverse mathematics, From learning in the limit to stochastic finite learning, Classes with easily learnable subclasses, On the classification of recursive languages, Noisy inference and oracles, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Prescribed Learning of R.E. Classes, A Note on the Relationship between Different Types of Correction Queries, Monotonic and dual monotonic language learning, Case-based representation and learning of pattern languages, Probabilistic language learning under monotonicity constraints, Learnability of automatic classes, Hypothesis spaces for learning, Synthesizing noise-tolerant language learners, Synthesizing learners tolerating computable noisy data, Vacillatory and BC learning on noisy data, Partial learning of recursively enumerable languages, Topological separations in inductive inference, Hypothesis Spaces for Learning, Prescribed learning of r.e. classes, Necessary and sufficient conditions for learning with correction queries, Learning languages and functions by erasing, The synthesis of language learners., Incremental concept learning for bounded data mining.
