Exactly learning automata with small cover time

Learning regular sets from queries and counterexamples

Information and Computation

Approximate counting, uniform generation and rapidly mixing Markov chains

Information and Computation

Prediction-preserving reducibility

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988

On learning from queries and counterexamples in the presence of noise

Information Processing Letters

Efficient learning of typical finite automata from random walks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Learning fallible finite state automata

COLT '93 Proceedings of the sixth annual conference on Computational learning theory

Cryptographic limitations on learning Boolean formulae and finite automata

Journal of the ACM (JACM)

Inference of finite automata using homing sequences

Information and Computation

Learning from a consistently ignorant teacher

COLT '94 Proceedings of the seventh annual conference on Computational learning theory

Optimality and domination in repeated games with bounded players

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning

Machine Learning

Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series

Learning From Noisy Examples

Machine Learning