Author： Kobayashi S. Yokomori T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.174, Iss.1, 1997-03, pp. : 251-257
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 regular languages using RFSAs
By Denis F. Lemay A. Terlutte A.
Theoretical Computer Science, Vol. 313, Iss. 2, 2004-02 ,pp. :
Access to resources
Recommend
Learning Regular Languages from Simple Positive Examples
By Denis F.
Machine Learning, Vol. 44, Iss. 1-2, 2001-07 ,pp. :
Regular component decomposition of regular languages
By Liu Y.J.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
On the acceptance power of regular languages
By Borchert B.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
On the entropy of regular languages
By Ceccherini-Silberstein T. Machi A. Scarabotti F.
Theoretical Computer Science, Vol. 307, Iss. 1, 2003-09 ,pp. :