{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:19:51Z","timestamp":1743139191883,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45583-3_17","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"205-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning by Switching Type of Information"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","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":[[2001,10,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Dana Angluin. Learning regular sets from queries and counter-examples. Information and Computation, 75:87\u2013106, 1987.","journal-title":"Information and Computation"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcss.1995.1066","volume":"51","author":"G. Baliga","year":"1995","unstructured":"Ganesh Baliga, John Case and Sanjay Jain. Language learning with some negative information. Journal of Computer and System Sciences, 51(5):273\u2013285, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Lenore Blum and Manuel Blum. Towarda mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"John Case, Sanjay Jain and Mandayam Suraj. Not-so-nearly-minimal-size program inference. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 77\u201396. Springer-Verlag, 1995.","key":"17_CR4","DOI":"10.1007\/3-540-60217-8_5"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"John Case and Carl Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R\u016bsi\u0146\u0161 Freivalds and Carl Smith. On the role of procrastination in machine learning. Information and Computation, pages 237\u2013271, 1993.","key":"17_CR6","DOI":"10.1006\/inco.1993.1068"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. Mark Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(93)90229-3","volume":"47","author":"S. Jain","year":"1993","unstructured":"Sanjay Jain and Arun Sharma. On the non-existence of maximal inference degrees for language identification. Information Processing Letters, 47:81\u201388, 1993.","journal-title":"Information Processing Letters"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S. Kleene","year":"1938","unstructured":"Stephen Kleene. Notations for ordinal numbers. Journal of Symbolic Logic, 3:150\u2013155, 1938.","journal-title":"Journal of Symbolic Logic"},{"unstructured":"M. Machtey and Paul Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978.","key":"17_CR10"},{"doi-asserted-by":"crossref","unstructured":"Wolfgang Merkle and Frank Stephan. Refuting learning revisited. Technical Report Forschungsberichte Mathematische Logik 52\/2001, Mathematisches Institut, Universit\u00e4t Heidelberg, 2001. Extended abstract to appear in Proceedings of the Twelfth International Conference on Algorithmic Learning Theory, 2001.","key":"17_CR11","DOI":"10.1007\/3-540-45583-3_23"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(91)90176-I","volume":"39","author":"T. Motoki","year":"1991","unstructured":"Tatsuya Motoki. Inductive inference from all positive and some negative data. Information Processing Letters, 39(4):177\u2013182, 1991.","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Daniel Osherson, Michael Stob and Scott Weinstein. Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, 1986.","key":"17_CR13","DOI":"10.7551\/mitpress\/6609.001.0001"},{"unstructured":"Hartley Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted by MIT Press in 1987.","key":"17_CR14"},{"doi-asserted-by":"crossref","unstructured":"Gerald E. Sacks. Higher Recursion Theory. Springer-Verlag, 1990.","key":"17_CR15","DOI":"10.1007\/978-3-662-12013-2"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jcss.1998.1568","volume":"56","author":"A. Sharma","year":"1998","unstructured":"Arun Sharma. A note on batch andincremen tal learnability. Journal of Computer and System Sciences, 56(3):272\u2013276, 1998.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/3-540-08353-7_182","volume-title":"Mathematical Foundations of Computer Science","author":"R. Wiehagen","year":"1977","unstructured":"Rolf Wiehagen. Identification of formal languages. In Mathematical Foundations of Computer Science, volume 53 of Lecture Notes in Computer Science, pages 571\u2013579. Springer-Verlag, 1977."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:18:56Z","timestamp":1585603136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}