N. Abe (1995), Characterizing PAC-learnability of semilinear sets. Inform. and Comput. 116, no. 1, 81--102. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Automata, Boolean Matrices, and Ultimate Periodicity - Zhang (Correct)
No context found.
N. Abe (1995), Characterizing PAC-learnability of semilinear sets. Inform. and Comput. 116, no. 1, 81--102.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC