Author： Jain S. Kinber E. Lange S. Wiehagen R. Zeugmann T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.241, Iss.1, 2000-06, pp. : 143-189
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Learning approximately regular languages with reversible languages
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Access to resources
Recommend
Learning regular languages using RFSAs
By Denis F. Lemay A. Terlutte A.
Theoretical Computer Science, Vol. 313, Iss. 2, 2004-02 ,pp. :
Stochastic Finite Learning of the Pattern Languages
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
On learning of functions refutably
By Jain S. Kinber E. Wiehagen R. Zeugmann T.
Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. :
Learning counting functions with queries
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :