Author： Krishna Rao M.R.K. Sattar A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.268, Iss.2, 2001-10, pp. : 179-198
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
Access to resources
Recommend
Polynomial Time Learnability of Simple Deterministic Languages
By Ishizaka H.
Machine Learning, Vol. 05, Iss. 2, 1990-06 ,pp. :
Polynomial-time identification of very simple grammars from positive data
By Yokomori T.
Theoretical Computer Science, Vol. 298, Iss. 1, 2003-04 ,pp. :
Criteria for Polynomial-Time (Conceptual) Clustering
By Pitt L.
Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. :