On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Author: Yokomori T.  

Publisher: Springer Publishing Company

ISSN: 0885-6125

Source: Machine Learning, Vol.19, Iss.2, 1995-05, pp. : 153-179

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract