Please use this identifier to cite or link to this item:
|Title:||Characterizing language identification by standardizing operations||Authors:||Jain, S.
|Issue Date:||Aug-1994||Citation:||Jain, S.,Sharma, A. (1994-08). Characterizing language identification by standardizing operations. Journal of Computer and System Sciences 49 (1) : 96-107. ScholarBank@NUS Repository.||Abstract:||Notions from formal language learning theory are characterized in terms of standardizing operations on classes of recursively enumerable languages. Algorithmic identification in the limit of grammars from text presentation of recursively enumerable languages is a central paradigm of language learning. A mapping, F, from the set of all grammars into the set of all grammars is a standardizing operation on a class of recursively enumerable languages ℳ just in case F maps any grammar for any language L ∈ ℳ to a canonical grammar for L. Investigating connections between these two notions is the subject of this paper. © 1994 Academic Press, Inc. All rights reserved.||Source Title:||Journal of Computer and System Sciences||URI:||http://scholarbank.nus.edu.sg/handle/10635/111151||ISSN:||00220000|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 18, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.