Automatic Learning from Positive Data and Negative Counterexamples
We introduce and study a model for learning in the limit by finite automata from positive data and negative counterexamples. The focus is on learning classes of languages with the membership problem computable by finite automata (so-called automatic classes). We show that, within the framework of our model, finite automata (automatic learners) can learn all automatic classes when memory of a learner is restricted by the size of the longest datum seen so far. We also study capabilities of automatic learners in our model with other restrictions on the memory and how the choice of negative counterexamples (arbitrary, or least, or the ones which are bounded by the largest positive datum seen so far) can impact automatic learnability.
Jain, S., Kinber, E., Stephan, F. (2017). Automatic learning from positive data and negative counterexamples. Information and Computation. doi:10.1016/j.ic.2017.05.002