Please use this identifier to cite or link to this item:
|Title:||Learnability of automatic classes|
|Authors:||Jain, S. |
|Source:||Jain, S., Luo, Q., Stephan, F. (2012). Learnability of automatic classes. Journal of Computer and System Sciences 78 (6) : 1910-1927. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jcss.2011.12.011|
|Abstract:||The present work initiates the study of the learnability of automatic indexable classes which are classes of regular languages of a certain form. Angluin's tell-tale condition characterises when these classes are explanatorily learnable. Therefore, the more interesting question is when learnability holds for learners with complexity bounds, formulated in the automata-theoretic setting. The learners in question work iteratively, in some cases with an additional long-term memory, where the update function of the learner mapping old hypothesis, old memory and current datum to new hypothesis and new memory is automatic. Furthermore, the dependence of the learnability on the indexing is also investigated. This work brings together the fields of inductive inference and automatic structures. © 2012 2012 Elsevier Inc. All rights reserved.|
|Source Title:||Journal of Computer and System Sciences|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 17, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.