Abstract
This paper is concerned with the problem of learning simple deterministic languages. The algorithm described in this paper is based on the theory of model inference given by Shapiro. In our setting, however, nonterminal membership queries, except for the start symbol, are not permitted. Extended equivalence queries are used instead. Nonterminals that are necessary for a correct grammar and their intended models are introduced automatically. We give an algorithm that, for any simple deterministic language L, outputs a grammar G in 2-standard form, such that L = L(G), using membership queries and extended equivalence queries. We also show that the algorithm runs in time polynomial in the length of the longest counterexample and the number of nonterminals in a minimal grammar for L.
Article PDF
Similar content being viewed by others
References
Angluin, D. (1987a). Learning k-bounded context-free grammars. (Technical Report YALEU/DCS/RR-557). New Haven, CT: Yale University, Department of Computer Science.
Angluin, D. (1987b). Learning regular sets from queries and counterexamples. Information and Computation, 75, 87-106.
Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
Banerji, R.B. (1988). Learning theories in a subset of a polyadic logic. Proceedings of the First Workshop on Computational Learning Theory (pp.281-295). San Mateo, CA: Morgan Kaufmann.
Herman, P. & Roos, R. (1987). Learning one-counter languages in polynomial time. Proceedings of the Twenty-Eighth IEEE Symposium on Foundations of Computer Science (pp.61-67). New York: The Institute of Electrical and Electronics Engineers.
Harrison, M.A. (1979). Introduction to Formal Language Theory. Reading, MA: Addison-Wesley.
Ishizaka, H. (1989). Inductive inference of regular languages based on model inference. International Journal of Computer Mathematics, 27, 67-83.
Muggleton, S. & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. Proceedings of the Fifth International Conference on Machine Learning (pp.339-352). San Mateo, CA: Morgan Kaufmann.
Pitt, L. (1989). Inductive inference, dfas, and computational complexity. Proceedings of the AII-89 Workshop on Analogical and Inductive Inference; Lecture Notes in Artificial Intelligence 397,(pp.18-44). Heidelberg: Springer-Verlag.
Pitt, L. & Warmuth, M.K. (1988). Prediction preserving reducibility. J. Comput.Sys.Sci. To appear.
Shapiro, E.Y. (1983). Algorithmic program debugging. Cambridge, MA: MIT Press.
Yokomori, T. (1988). Learning simple languages in polynomial time. Proceedings of SIG-FAI (pp.21-30). Tokyo, Japan: Japanese Society for Artificial Intelligence.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ishizaka, H. Polynomial Time Learnability of Simple Deterministic Languages. Machine Learning 5, 151–164 (1990). https://doi.org/10.1023/A:1022644732619
Issue Date:
DOI: https://doi.org/10.1023/A:1022644732619