Searching for "Polynomial time Learnability of Simple Deterministic Languages." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample
by Yasuhiro Tajima Student, Yasuhiro Tajima, Student Member, Etsuji Tomita, Mitsuo Wakatsuki — 2000
… show the main theorem. Theorem 4: Simple deterministic langumin are polynomial time learnable from MAT…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB