Robust learning of automatic classes of languages

DOI10.1016/j.jcss.2013.12.002zbMath1285.68074OpenAlexW2031453431MaRDI QIDQ2637647

Eric Martin, Sanjay Jain, Frank Stephan

Publication date: 13 February 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.12.002

zbMATH Keywords

translationsinductive inferenceautomatic structuresquery learninglearning in the limitrobust learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• Learning indexed families of recursive languages from positive data: A survey
• Learning regular sets from queries and counterexamples
• Avoiding coding tricks by hyperrobust learning
• Learnability of automatic classes
• Formal language identification: query learning vs. gold-style learning
• Robust separations in inductive inference
• Inductive inference of formal languages from positive data
• Inductive inference of automata, functions and programs
• Criteria of language learning
• ON AUTOMATIC FAMILIES
• Language identification in the limit
• Robust learning is rich

This page was built for publication: Robust learning of automatic classes of languages