1. Abe, N., “Feasible learnability of Formal Grammars and the Theory of Natural Language Acquisition,” inProceedings of COLING-88, August 1988.
2. Angluin, D. and Kharitonov, M., “When Wont’ Membership Queries Help?” inProc. of the 23rd Symposium on Theory of Computing, ACM Press, New York, NY, pp. 444–454, 1991.
3. Abe, N. and Mamitsuka, H., “A New Method for Predicting Protein Secondary Structures Based on Stochastic Tree Grammars,” inProceedings of the Eleventh International Conference on Machine Learning, 1994.
4. Abe, N. and Takeuchi, J., “The ‘Lob-Pass’ Problem and an On-Line Learning Model of Rational Choice,” inProceedings of the Sixth Annual ACM Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, California, August 1993.
5. Abe, N. and Warmuth, M. K., “On the Computational Complexity of Approximating Probability Distributions by Probabilistic Automata,”Machine Learning, 9, 2/3, pp. 205–260, 1992.