We introduce an abstract model of exact learning via queries that can be instantiated to all the query learning models currently in use, while being closer to them than previous uniicatory attempts.â€¦ (More)

We present an improvement of an algorithm due to Clark and Thollard (Journal of Machine Learning Research, 2004) for PAC-learning distributions generated by Probabilistic Deterministic Finiteâ€¦ (More)

Optical cross-connects (OXC) introduce crosstalk and intersymbolic interference due to filtering in the optical signal. We show experimentally and by simulation that higher optical signal-to-noiseâ€¦ (More)

We give some characterizations of the classes P [O(log n)]. First, we show that these classes are equal to classes ACkâˆ’1(NP ). Second, we prove that they are also equivalent to some classes definedâ€¦ (More)

We prove that log n-decision lists |the class of decision lists such that all their terms have low Kolmogorov complexity| are learnable in the simple PAC learning model. The proof is based on aâ€¦ (More)

We prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability viaâ€¦ (More)

Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability Î¼ of the target machine, besides the number of states and the usual accuracy andâ€¦ (More)

We prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability viaâ€¦ (More)