Learnability of Automatic Classes
| dc.contributor.author | JAIN, Sanjay | en_US |
| dc.contributor.author | LUO, Qinglong | en_US |
| dc.contributor.author | STEPHAN, Frank | en_US |
| dc.date.accessioned | 2009-01-29T02:57:33Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:09Z | |
| dc.date.available | 2009-01-29T02:57:33Z | en_US |
| dc.date.available | 2017-01-23T07:00:09Z | |
| dc.date.issued | 2009-01-29T02:57:33Z | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 276953 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2895 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA1/09 | en_US |
| dc.title | Learnability of Automatic Classes | en_US |
| dc.type | Technical Report | en_US |