Please use this identifier to cite or link to this item:
|Title:||Uncountable automatic classes and learning|
|Authors:||Jain, S. |
|Source:||Jain, S., Luo, Q., Semukhin, P., Stephan, F. (2011). Uncountable automatic classes and learning. Theoretical Computer Science 412 (19) : 1805-1820. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tcs.2010.12.057|
|Abstract:||In this paper we consider uncountable classes recognizable by ω-automata and investigate suitable learning paradigms for them. In particular, the counterparts of explanatory, vacillatory and behaviourally correct learning are introduced for this setting. Here the learner reads in parallel the data of a text for a language L from the class plus an ω-index α and outputs a sequence of ω-automata such that all but finitely many of these ω-automata accept the index α if and only if α is an index for L. It is shown that any class is behaviourally correct learnable if and only if it satisfies Angluin's tell-tale condition. For explanatory learning, such a result needs that a suitable indexing of the class is chosen. On the one hand, every class satisfying Angluin's tell-tale condition is vacillatorily learnable in every indexing; on the other hand, there is a fixed class such that the level of the class in the hierarchy of vacillatory learning depends on the indexing of the class chosen. We also consider a notion of blind learning. On the one hand, a class is blind explanatorily (vacillatorily) learnable if and only if it satisfies Angluin's tell-tale condition and is countable; on the other hand, for behaviourally correct learning, there is no difference between the blind and non-blind version. This work establishes a bridge between the theory of ω-automata and inductive inference (learning theory). © 2010 Elsevier B.V. All rights reserved.|
|Source Title:||Theoretical Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2018
WEB OF SCIENCETM
checked on Nov 22, 2017
checked on Jan 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.