Probabilistic language learning under monotonicity constraints

DOI10.1007/3-540-60454-5_37zbMath1527.68110OpenAlexW4242588697MaRDI QIDQ6083909

Léa Meyer

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60454-5_37

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• On the power of probabilistic strategies in inductive inference
• Characterizations of monotonic and dual monotonic language learning
• Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings
• Probabilistic inductive inference
• Inductive inference of formal languages from positive data
• Language identification in the limit

This page was built for publication: Probabilistic language learning under monotonicity constraints