{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T09:59:37Z","timestamp":1648547977948},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4733,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0304-3975(98)00339-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:43:06Z","timestamp":1027629786000},"page":"135-165","source":"Crossref","is-referenced-by-count":1,"title":["Structural measures for games and process control in the branch learning model"],"prefix":"10.1016","volume":"244","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":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(98)00339-9_BIB1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.2307\/2275058","article-title":"Inductive inference and unsolvability","volume":"56","author":"Adleman","year":"1991","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB2","series-title":"Proc. 5th Internat. Workshop on Algorithmic Learning Theory","first-page":"40","article-title":"Therapy plan generation as program synthesis","author":"Arnold","year":"1994"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Towards a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","article-title":"Solving sequential conditions by finite-state strategies","volume":"138","author":"B\u00fcchi","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB5","first-page":"140","article-title":"Learning recursive functions from approximations","volume":"vol. 904","author":"Case","year":"1995"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB6","series-title":"Proc. 9th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence","article-title":"Learning to win process-control games watching game-masters","author":"Case","year":"1998"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0165-4896(92)90059-E","article-title":"Recursively presented games and strategies","volume":"24","author":"Cenzer","year":"1992","journal-title":"Math. Social Sci."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB9","unstructured":"O. F\u00f6llinger, Regelungstechnik, 8th ed., H\u00fcthig, Heidelberg, 1994."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0168-0072(94)90035-3","article-title":"Extremes in the degrees of inferability","volume":"66","author":"Fortnow","year":"1994","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/FI-1996-25106","article-title":"On a quantitative notion of uniformity","volume":"25","author":"Kaufmann","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB13","first-page":"368","article-title":"Effective strategies for enumeration games","volume":"vol. 1092","author":"Kummer","year":"1996"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB14","series-title":"Proc. 9th Annual Conf. on Computational Learning Theory","first-page":"280","article-title":"Learning branches and learning to win closed games","author":"Kummer","year":"1996"},{"issue":"2","key":"10.1016\/S0304-3975(98)00339-9_BIB15","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/jcss.1996.0018","article-title":"On the structure of degrees of inferability","volume":"52","author":"Kummer","year":"1996","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0304-3975(98)00339-9_BIB16","first-page":"291","article-title":"On some games which are relevant to the theory of recursively enumerable sets","volume":"91","author":"Lachlan","year":"1970","journal-title":"nn. Math."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB17","unstructured":"D. Luzeaux, Machine learning applied to the control of complex systems, in: 8th Internat. Conf. on Artificial Intelligence and expert systems applications, Paris, France, 1996."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB18","unstructured":"D. Luzeaux, E. Martin, Steps or stages for incremental control? in: Symp. on Training Issues in Incremental Learning, AAAI-93 Spring Symposium Series, Stanford University, CA, USA, 1993."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB19","first-page":"229","article-title":"On the synthesis of discrete controllers for timed systems","volume":"vol. 900","author":"Maler","year":"1995"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB20","doi-asserted-by":"crossref","unstructured":"E. Martin, Oracles for learning programs, in: IEEE Internat. Conf. on Systems Man Cybernetics, Le Touquet, France, 1993.","DOI":"10.1109\/ICSMC.1993.390742"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB21","doi-asserted-by":"crossref","unstructured":"E. Martin, D. Luzeaux, B. Zavidovique, Learning and control from a recursive viewpoint, in: IEEE Internat. Symp. on Intelligent Control, Glasgow, Ecosse, 1992.","DOI":"10.1109\/ISIC.1992.225071"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","article-title":"Infinite games played on finite graphs","volume":"65","author":"McNaughton","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB23","series-title":"Neural Networks for Control","year":"1990"},{"issue":"5","key":"10.1016\/S0304-3975(98)00339-9_BIB24","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/37.126848","article-title":"Intelligent control using neural networks","volume":"12","author":"Narendra","year":"1992","journal-title":"IEEE Control Systems Magazine"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB25","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB26","series-title":"Systems that Learn","author":"Osherson","year":"1986"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB27","unstructured":"M. Ott, Learning Strategies for Infinite Games, Doctoral dissertation, Institut f\u00fcr Logik, Komplexit\u00e4t und Deduktionssysteme, Universit\u00e4t Karlsruhe, Shaker Verlag, Aachen, 1998."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB28","unstructured":"M. Riedmiller, Learning to control dynamic systems, in: R. Trappl (Ed.), Proc. 13th European Meeting on Cybernetics and Systems Research, Vienna, 1996."},{"issue":"4","key":"10.1016\/S0304-3975(98)00339-9_BIB29","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S0363012991217536","article-title":"Control of infinite behavior of finite automata","volume":"32","author":"Thistle","year":"1994","journal-title":"SIAM J. Control and Optim."},{"key":"10.1016\/S0304-3975(98)00339-9_BIB30","series-title":"Handbook of Theoretical Computer Science","first-page":"133","article-title":"Automata on infinite objects","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB31","first-page":"1","article-title":"On the synthesis of strategies in infinite games","volume":"vol. 900","author":"Thomas","year":"1995"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB32","first-page":"583","article-title":"Logical specification of infinite computations","volume":"vol. 803","author":"Thomas","year":"1993"},{"key":"10.1016\/S0304-3975(98)00339-9_BIB33","series-title":"Handbook of Intelligent Control","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T21:34:48Z","timestamp":1579210488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0304397598003399"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00339-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}