|
DSpace at School of Computing, NUS >
School of Computing >
Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1900.100/2895
|
| Title: | Learnability of Automatic Classes |
| Authors: | JAIN, Sanjay
LUO, Qinglong
STEPHAN, Frank |
| Issue Date: | 29-Jan-2009 |
| Series/Report no.: | ;TRA1/09 |
| Abstract: | The present work initiates the study of the learnability of automatic indexable classes which are classes of regular languages of a certain form. It is characterised which of these classes are explanatorily learnable. Furthermore, the notion of an automatic iterative learner is introduced and it is studied for automatic classes whether they are learnable by an automatic iterative learner, learnable by an automatic iterative learner with additional long-term memory or unlearnable by such a learner. The dependence of the learnability on the indexing is also investigated. This work brings together the fields of inductive inference and automatic structures. |
| URI: | http://hdl.handle.net/1900.100/2895 |
| Appears in Collections: | Technical Reports
|
Files in This Item:
| File |
Size | Format |
|---|
| TRA1-09.pdf | 270Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
