Monotonic and dual monotonic language learning

DOI10.1016/0304-3975(95)00284-7zbMath0872.68146OpenAlexW2070494326MaRDI QIDQ672148

Steffen Lange, Shyam Kapur, Thomas Zeugmann

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00284-7

zbMATH Keywords

algorithmic language learningdual monotonic language learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (18)

Generalized notions of mind change complexity ⋮ On the data consumption benefits of accepting increased uncertainty ⋮ A modal logic for supervised learning ⋮ Probabilistic language learning under monotonicity constraints ⋮ Noisy inference and oracles ⋮ Prescribed Learning of R.E. Classes ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Characterizing language identification in terms of computable numberings ⋮ Noisy inference and oracles ⋮ Hypothesis spaces for learning ⋮ Synthesizing noise-tolerant language learners ⋮ Synthesizing learners tolerating computable noisy data ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Hypothesis Spaces for Learning ⋮ Prescribed learning of r.e. classes ⋮ Set-driven and rearrangement-independent learning of recursive languages ⋮ Ordinal mind change complexity of language identification ⋮ Mapping monotonic restrictions in inductive inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• Polynomial-time inference of arbitrary pattern languages
• Prudence and other conditions on formal language learning
• Finding patterns common to a set of strings
• Characterizations of monotonic and dual monotonic language learning
• Computational limitations on learning from examples
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Characterization of language learning front informant under various monotonicity constraints
• Ignoring data may be the only way to learn efficiently
• Inclusion is undecidable for pattern languages
• Set-driven and rearrangement-independent learning of recursive languages
• Language identification in the limit
• A formal theory of inductive inference. Part II

This page was built for publication: Monotonic and dual monotonic language learning