Skip to main content

A formal study of learning via queries

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 443))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin, Learning regular sets from queries and counterexamples, Inform. and Comput. 75 (1987), 87–106.

    Google Scholar 

  2. D. Angluin, Queries and concept learning, Machine Learning 2 (1988), 319–342.

    Google Scholar 

  3. J. Balcázar, J. Díaz, and J. Gabarró, “Structural Complexity I”, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1988).

    Google Scholar 

  4. S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), 186–208.

    Google Scholar 

  5. T. Nishino, Learning weak monadic second-order logical formulas from queries and counterexamples, manuscript.

    Google Scholar 

  6. Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, in “Proc. 1st Workshop on Computational Learning Theory”, (1988).

    Google Scholar 

  7. U. Schöning, “Complexity and Structure”, Lecture Notes in Computer Science 211, Springer-Verlag (1985).

    Google Scholar 

  8. W. Tzeng, Learning probabilistic automata and Markov chains via queries, manuscript.

    Google Scholar 

  9. M. Warmuth, Towards representation independence in PAC learning, Lecture Notes in AI 397, Springer-Verlag (1989), 78–103.

    Google Scholar 

  10. T. Yokomori, On learning a class of context-free languages in polynomial time, manuscript.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michael S. Paterson

Rights and permissions

Reprints 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

Publish with us

Policies and ethics