Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. N. Abe. Feasible learnability of formal grammars and the theory of natural language acquisition. In Proceedings of COLING-88, August 1988.
2. D. Angluin and M. Kharitonov. When won't membership queries help? In Proc. of the 23rd Symposium on Theory of Computing, pages 444–454. ACM Press, New York, NY, 1991.
3. N. Abe and H. Mamitsuka. A new method for predicting protein secondary structures based on stochastic tree grammars. In Proceedings of the Eleventh International Conference on Machine Learning, 1994.
4. N. Abe and J. Takeuchi. The ‘lob-pass’ problem and an on-line learning model of rational choice. In Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo, California, August 1993.
5. N. Abe and M. K. Warmuth. On the computational complexity of approximating probability distributions by probabilistic automata. Machine Learning, 9 (2/3), 1992. A special issue for COLT'90.