{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:17Z","timestamp":1725664997152},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626855"},{"type":"electronic","value":"9783540684312"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62685-9_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:47:58Z","timestamp":1330296478000},"page":"94-108","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Structural measures for games and process control in the branch learning model"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Ott","sequence":"first","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2275058","volume":"56","author":"L. Adleman","year":"1991","unstructured":"L. Adleman and M. Blum. Inductive inference and unsolvability. Journal of Symbolic Logic, 56(3):891\u2013900, 1991.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"O. Arnold and K. P. Jantke. Therapy plan generation as program synthesis. In Proc. 5th Int. Workshop on Algorithmic Learning Theory, pages 40\u201355. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58520-6_52"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"9_CR4","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":"9_CR5","doi-asserted-by":"crossref","unstructured":"J. Case, S. Kaufmann, E. Kinber, and M. Kummer. Learning recursive functions from approximations. In EuroCOLT'95, volume 904 of LNCS, pages 140\u2013153. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59119-2_174"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0165-4896(92)90059-E","volume":"24","author":"D. Cenzer","year":"1992","unstructured":"D. Cenzer and J. Remmel. Recursively presented games and strategies. Mathematical Social Sciences, 24:117\u2013139, 1992.","journal-title":"Mathematical Social Sciences"},{"key":"9_CR7","unstructured":"O. F\u00f6llinger. Regelungstechnik. H\u00fcthig, Heidelberg, 8th edition, 1994."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0168-0072(94)90035-3","volume":"66","author":"L. Fortnow","year":"1994","unstructured":"L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, and F. Stephan. Extremes in the degrees of inferability. Annals of Pure and Applied Logic, 66:21\u2013276, 1994.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"S. Kaufmann and M. Kummer. On a quantitative notion of uniformity. In Mathematical Foundations of Computer Science, volume 969 of LNCS, pages 169\u2013178. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60246-1_123"},{"key":"9_CR11","first-page":"368","volume-title":"Effective strategies for enumeration games","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, pages 368\u2013387, Berlin, 1996. Springer."},{"key":"9_CR12","first-page":"280","volume-title":"Learning branches and learning to win closed games","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."},{"issue":"2","key":"9_CR13","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/jcss.1996.0018","volume":"52","author":"M. Kummer","year":"1996","unstructured":"M. Kummer and F. Stephan. On the structure of degrees of inferability. Journal of Computer and System Sciences, 52(2):214\u2013238, Apr. 1996.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"9_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/1970579","volume":"91","author":"A. H. Lachlan","year":"1970","unstructured":"A. H. Lachlan. On some games which are relevant to the theory of recursively enumerable sets. Annals of Mathematics, 91(2):291\u2013310, 1970.","journal-title":"Annals of Mathematics"},{"key":"9_CR15","unstructured":"D. Luzeaux. Machine learning applied to the control of complex systems. In 8th International Conference on Artificial Intelligence and expert systems applications, Paris, France, 1996."},{"key":"9_CR16","series-title":"AAAI-93 Spring Symposium Series","volume-title":"Steps or stages for incremental control?","author":"D. Luzeaux","year":"1993","unstructured":"D. Luzeaux and E. Martin. Steps or stages for incremental control? In Symposium on training issues in incremental learning, Stanford University, CA, USA, 1993. AAAI-93 Spring Symposium Series."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of discrete controllers for timed systems. In STACS 95, volume 900 of LNCS, pages 229\u2013242. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"9_CR18","unstructured":"E. Martin. Oracles for learning programs. In IEEE International Conference on Systems Man Cybernetics, Le Touquet, France, 1993."},{"key":"9_CR19","unstructured":"E. Martin, D. Luzeaux, and B. Zavidovique. Learning and control from a recursive viewpoint. In IEEE International Symposium on Intelligent Control, Glasgow, Ecosse, 1992."},{"key":"9_CR20","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"},{"volume-title":"Neural networks for control","year":"1990","key":"9_CR21","unstructured":"W. T. Miller, R. S. Sutton, and P. J. Werbos, editors. Neural networks for control. MIT Press, Cambridge, Massachusetts, 1990."},{"issue":"5","key":"9_CR22","first-page":"11","volume":"12","author":"K. S. Narendra","year":"1992","unstructured":"K. S. Narendra and S. Mukhopadhyay. Intelligent control using neural networks. IEEE Control Systems Magazine, 12(5):11\u201318, April 1992.","journal-title":"IEEE Control Systems Magazine"},{"key":"9_CR23","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"9_CR24","volume-title":"Systems that Learn","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn. MIT Press, Cambridge, Massachusetts, 1986."},{"key":"9_CR25","unstructured":"M. Ott and F. Stephan. Structural measures for games and process control in the branch learning model. Technical report 39\/96, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karsruhe, 1996."},{"key":"9_CR26","unstructured":"M. Riedmiller. Learning to control dynamic systems. In R. Trappl, editor, Proceedings of the 13th. European Meeting on Cybernetics and Systems Research \u2014 1996 (EMCSR '96), Vienna, 1996."},{"issue":"4","key":"9_CR27","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S0363012991217536","volume":"32","author":"J. G. Thistle","year":"1994","unstructured":"J. G. Thistle and W. M. Wonham. Control of infinite behavior of finite automata. SIAM Journal on Control and Optimization, 32(4):1075\u20131097, 1994.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133\u2013191. Elsevier Science Publishers B. V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"9_CR29","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":"9_CR30","doi-asserted-by":"crossref","unstructured":"W. Thomas and H. Lescow. Logical specification of infinite computations. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency: Reflections and Perspectives, volume 803 of LNCS, pages 583\u2013621. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-58043-3_29"},{"volume-title":"Handbook of Intelligent Control","year":"1992","key":"9_CR31","unstructured":"D. A. White and D. A. Sofge, editors. Handbook of Intelligent Control. Van Nostrand Reinhold, New York, 1992."}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62685-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:12:33Z","timestamp":1578528753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62685-9_9"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626855","9783540684312"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-62685-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}