Probabilistic language learning under monotonicity constraints

DOI10.1016/S0304-3975(97)00017-0zbMath0911.68099MaRDI QIDQ1390945

Léa Meyer

Publication date: 22 July 1998

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

zbMATH Keywords

strong-monotonic probabilistic learning; uniformly recursive languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Probabilistic inductive inference: A survey, Aspects of complexity of probabilistic learning under monotonicity constraints, Absolute versus probabilistic classification in a logical setting

Cites Work

• Comparison of identification criteria for machine inductive inference
• Monotonic and dual monotonic language learning
• Monotonic and non-monotonic inductive inference
• On the power of probabilistic strategies in inductive inference
• One-sided error probabilistic inductive inference and reliable frequency identification
• Probability and plurality for aggregations of learning machines
• Extremes in the degrees of inferability
• On aggregating teams of learning machines
• A theory of the learnable
• Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
• Probabilistic inductive inference
• Inductive inference of formal languages from positive data
• The Power of Pluralism for Automatic Program Synthesis
• Toward a mathematical theory of inductive inference
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• The power of probabilism in Popperian FINite learning
• Set-driven and rearrangement-independent learning of recursive languages
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit
• 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