Bounds for width two branching programs
SIAM Journal on Computing
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Learning regular sets from queries and counterexamples
Information and Computation
Computational limitations on learning from examples
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Inference of finite automata using homing sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
SIAM Journal on Computing
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
On the Computational Complexity of Approximating Distributions by Probabilistic Automata
Machine Learning - Computational learning theory
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
On the learnability of discrete distributions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Machine Learning
Part-of-speech tagging using a Variable Memory Markov model
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
On learning width two branching programs (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Hardness Results for Learning First-Order Representations and Programming by Demonstration
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
On the Practice of Branching Program Boosting
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Testing computability by width-two OBDDs
Theoretical Computer Science
Testing computability by width-2 OBDDs where the variable order is unknown
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the learnability of shuffle ideals
The Journal of Machine Learning Research
| Hi-index | 0.00 |