This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin, Learning regular sets from queries and counterexamples, Inform. and Comput. 75 (1987), 87–106.
D. Angluin, Queries and concept learning, Machine Learning 2 (1988), 319–342.
J. Balcázar, J. Díaz, and J. Gabarró, “Structural Complexity I”, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1988).
S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), 186–208.
T. Nishino, Learning weak monadic second-order logical formulas from queries and counterexamples, manuscript.
Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, in “Proc. 1st Workshop on Computational Learning Theory”, (1988).
U. Schöning, “Complexity and Structure”, Lecture Notes in Computer Science 211, Springer-Verlag (1985).
W. Tzeng, Learning probabilistic automata and Markov chains via queries, manuscript.
M. Warmuth, Towards representation independence in PAC learning, Lecture Notes in AI 397, Springer-Verlag (1989), 78–103.
T. Yokomori, On learning a class of context-free languages in polynomial time, manuscript.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, O. (1990). A formal study of learning via queries. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032028
Download citation
DOI: https://doi.org/10.1007/BFb0032028
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive