{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:13Z","timestamp":1725551653547},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_31","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"283-292","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of learning branches and strategies from queries"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Ott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51(1):76\u201387, 1981.","journal-title":"Information and Control"},{"issue":"2","key":"31_CR2","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. Comput., 75(2):87\u2013106, Nov. 1987.","journal-title":"Inform. Comput."},{"key":"31_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"issue":"2","key":"31_CR4","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin. Negative results for equivalence queries. Machine Learning, 5(2):121\u2013150, June 1990.","journal-title":"Machine Learning"},{"key":"31_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. R. B\u00fcchi","year":"1969","unstructured":"J. R. B\u00fcchi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society, 138:295\u2013311, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"31_CR6","unstructured":"J. Case, M. Ott, A. Sharma, and F. Stephan. Learning to win process-control games watching game-masters. Submitted."},{"key":"31_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9440-2","volume-title":"Measure Theory","author":"P. R. Halmos","year":"1950","unstructured":"P. R. Halmos. Measure Theory. Van Nostrand, Princeton, New Jersey, 1950."},{"key":"31_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4168.001.0001","volume-title":"Learning in Embedded Systems","author":"L. P. Kaelbling","year":"1993","unstructured":"L. P. Kaelbling. Learning in Embedded Systems. The MIT Press: Cambridge, MA, 1993."},{"key":"31_CR9","first-page":"368","volume-title":"Proceedings of Computer Science Logic CSL '95, volume 1092 of LNCS","author":"M. Kummer","year":"1996","unstructured":"M. Kummer and M. Ott. Effective strategies for enumeration games. In H. K. B\u00fcning, editor, Proceedings of Computer Science Logic CSL '95, volume 1092 of LNCS, pages 368\u2013387, Berlin, 1996. Springer."},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/238061.238119","volume-title":"In Proceedings of Ninth Annual Conference on Computational Learning Theory","author":"M. Kummer","year":"1996","unstructured":"M. Kummer and M. Ott. Learning branches and learning to win closed games. In Proceedings of Ninth Annual Conference on Computational Learning Theory, pages 280\u2013291, New York, 1996. ACM."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"H. Lescow. On polynomial-size programs winning finite-state games. In CAV: International Conference on Computer Aided Verification, pages 239\u2013252, 1995.","DOI":"10.1007\/3-540-60045-0_54"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"M. Ott and F. Stephan. Structural measures for games and process control in the branch learning model. In S. Ben-David, editor, Proceedings of the Third European Conference on Computational Learning Theory, volume 1208 of LNAI, pages 94\u2013108. Springer, 1997.","DOI":"10.1007\/3-540-62685-9_9"},{"key":"31_CR14","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/238061.238153","volume-title":"Proceedings of the 9th Annual ACM Conference on Computational Learning Theory (COLT'96)","author":"C. D. Rosin","year":"1996","unstructured":"C. D. Rosin and R. K. Belew. A competitive approach to game learning. In Proceedings of the 9th Annual ACM Conference on Computational Learning Theory (COLT'96), pages 292\u2013302. ACM Press, New York, NY, 1996."},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"W. Thomas. On the synthesis of strategies in infinite games. In STACS 95, volume 900 of LNCS, pages 1\u201313. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"R. Wiehagen. From inductive inference to algorithmic learning theory. New Generation Computing, 12, 1994.","DOI":"10.1007\/BF03037350"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:38:04Z","timestamp":1559003884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}