Limit learning equivalence structures

MaRDI QIDQ7034391zbMATH OpenFDO

Authors E. B. Fokina, Timo Kötzing, Luca San Mauro

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/fokina19a.html

zbMATH Keywords

equivalence structuresGold-style learningfinite separabilitylearning from informant

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Computable structure theory, computable model theory (03C57)

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• A Friedberg enumeration of equivalence structures
• Analytic equivalence relations and bi-embeddability
• Computable structures and the hyperarithmetical hierarchy
• Effective categoricity of equivalence structures
• Inductive inference of formal languages from positive data
• Isomorphism relations on computable structures
• Language identification in the limit
• Learning algebraic structures from text
• On the learnability of vector spaces
• Systems that learn. An introduction to learning theory for cognitive and computer scientists
• Trees and learning
• Universal computably enumerable equivalence relations

Cited in

(4)

• Learning families of algebraic structures from text
• Classifying different criteria for learning algebraic structures
• Syntactic characterization of learnability of structures with mind changes
• On learning existentially definable subsets in a computable structure

This page was built for publication: Limit learning equivalence structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034391)