Learnability and positive equivalence relations

DOI10.1007/978-3-030-68195-1_12OpenAlexW3135126344MaRDI QIDQ2232273

Wei Li, Sanjay Jain, Ziyuan Gao, Frank Stephan, David R. Belanger

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2012.01466

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Reducibilities among equivalence relations induced by recursively enumerable structures
• An easy priority-free proof of a theorem of Friedberg
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Positive equivalences
• The synthesis of language learners.
• Graphs realised by r.e. equivalence relations
• LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS
• Inductive inference of formal languages from positive data
• Rekursive Algebren mit Kettenbedingungen
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Some decidability results on grammatical inference and complexity
• Language identification in the limit

This page was built for publication: Learnability and positive equivalence relations