A Characterization of the Language Classes Learnable with Correction Queries

DOI10.1007/978-3-540-72504-6_36zbMath1198.68159OpenAlexW1584961403MaRDI QIDQ5425451

Cristina Tîrnăucă, Satoshi Kobayashi

Publication date: 13 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_36

zbMATH Keywords

query learningGold-style learningcorrection query

Mathematics Subject Classification ID

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

Related Items (3)

Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ A Note on the Relationship between Different Types of Correction Queries ⋮ One-shot learners using negative counterexamples and nearest positive examples

This page was built for publication: A Characterization of the Language Classes Learnable with Correction Queries