{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:29Z","timestamp":1725456989466},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032028","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"139-152","source":"Crossref","is-referenced-by-count":9,"title":["A formal study of learning via queries"],"prefix":"10.1007","author":[{"given":"Osamu","family":"Watanabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D. Angluin, Learning regular sets from queries and counterexamples, Inform. and Comput. 75 (1987), 87\u2013106.","journal-title":"Inform. and Comput."},{"key":"12_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin, Queries and concept learning, Machine Learning 2 (1988), 319\u2013342.","journal-title":"Machine Learning"},{"key":"12_CR3","volume-title":"\u201cStructural Complexity I\u201d, EATCS Monographs on Theoretical Computer Science","author":"J. Balc\u00e1zar","year":"1988","unstructured":"J. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3, \u201cStructural Complexity I\u201d, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin (1988)."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Comput. 18 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"unstructured":"T. Nishino, Learning weak monadic second-order logical formulas from queries and counterexamples, manuscript.","key":"12_CR5"},{"unstructured":"Y. Sakakibara, Learning context-free grammars from structural data in polynomial time, in \u201cProc. 1st Workshop on Computational Learning Theory\u201d, (1988).","key":"12_CR6"},{"doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning, \u201cComplexity and Structure\u201d, Lecture Notes in Computer Science 211, Springer-Verlag (1985).","key":"12_CR7","DOI":"10.1007\/3-540-16079-5"},{"unstructured":"W. Tzeng, Learning probabilistic automata and Markov chains via queries, manuscript.","key":"12_CR8"},{"doi-asserted-by":"crossref","unstructured":"M. Warmuth, Towards representation independence in PAC learning, Lecture Notes in AI 397, Springer-Verlag (1989), 78\u2013103.","key":"12_CR9","DOI":"10.1007\/3-540-51734-0_53"},{"unstructured":"T. Yokomori, On learning a class of context-free languages in polynomial time, manuscript.","key":"12_CR10"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032028","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:06Z","timestamp":1586612706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0032028","relation":{},"subject":[]}}