Please use this identifier to cite or link to this item:
|Title:||On the amount of nonconstructivity in learning formal languages from positive data|
|Authors:||Jain, S. |
|Citation:||Jain, S.,Stephan, F.,Zeugmann, T. (2012). On the amount of nonconstructivity in learning formal languages from positive data. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7287 LNCS : 423-434. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-29952-0_41|
|Abstract:||Nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton  and Freivalds [9, 10]. They allow to regard more complicated algorithms from the viewpoint of more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. This paper studies the amount of nonconstructivity needed to learn classes of formal languages from positive data. Different learning types are compared with respect to the amount of nonconstructivity needed to learn indexable classes and recursively enumerable classes, respectively, of formal languages from positive data. Matching upper and lower bounds for the amount of nonconstructivity needed are shown. © 2012 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.