A class of languages is automatic if it is uniformly regular using some regular index set for the languages. In this survey we report on work about the learnability in the limit of automatic classes of languages, with some special emphasis to automatic learners.

This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the prese...

Article history: Received 16 May 2008 Received in revised form 25 March 2009 Accepted 27 March 2009 Available online 9 April 2009

Teachability and Learnability across Languages, edited by Ragnar Arntzen, Gisela Håkansson, Arnsterie Hjelde, Jörg-U. Keßler (2019)Amsterdam/Philadelphia: John Benjamins, 263 pp.