Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample (2000)  (Make Corrections)   IEICE TRANS. INF. SYST., VOL.E83-D, NO.4 APRIL 2000 PAPER Yasuhiro TAJIMA...IEICE Transactions on Information and Systems   Home/Search   Context   Related

View or download: ieice.org/2000/files/...e83d_4_757.pdf Cached:  PS.gz  PS  PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.   PS.gz  PS  PDF   Image  Update  Help From:  ieice.org/2000/files/e000d04 (more) (Enter author homepages)

Rate this article: (best)   Comment on this article

@article{ tajima00polynomial,
    author = "Yasuhiro Tajima and Etsuji Tomita and Mitsuo Wakatsuki",
    title = "Polynomial Time Learnability of Simple Deterministic Languages from {MAT} and a Representative Sample",
    journal = "IEICE Transactions on Information and Systems",
    volume = "E83-D",
    number = "4",
    pages = "757--765",
    year = "2000",
    url = "citeseer.ist.psu.edu/354302.html" }