Automatic Learners with Feedback Queries

DOI10.1007/978-3-642-21875-0_4zbMath1344.68104OpenAlexW98521082MaRDI QIDQ3091438

Yuh Shin Ong, Sanjay Jain, Pavel Semukhin, Frank Stephan, John Case

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_4

Mathematics Subject Classification ID

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

Related Items

Automatic learners with feedback queries, Mind change speed-up for learning languages from positive data, Learnability of automatic classes

Cites Work

• Unnamed Item
• Unnamed Item
• Learning indexed families of recursive languages from positive data: A survey
• Learning regular sets from queries and counterexamples
• Finding patterns common to a set of strings
• Identification of function distinguishable languages.
• Incremental learning from positive data
• Incremental concept learning for bounded data mining.
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Automatic Learning of Subclasses of Pattern Languages
• Automata Presenting Structures: A Survey of the Finite String Case
• Learnability of Automatic Classes
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Toward a mathematical theory of inductive inference
• On the impact of forgetting on learning machines
• ON AUTOMATIC FAMILIES
• STACS 2004
• Language identification in the limit