{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:19:17Z","timestamp":1725563957601},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_25","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T12:58:37Z","timestamp":1283259517000},"page":"300-314","source":"Crossref","is-referenced-by-count":1,"title":["Learning without Coding"],"prefix":"10.1007","author":[{"suffix":"III","given":"Samuel E.","family":"Moelius","sequence":"first","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci.\u00a021(1), 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Inform. Control\u00a028(2), 125\u2013155 (1975)","journal-title":"Inform. Control"},{"issue":"29-30","key":"25_CR3","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1016\/j.tcs.2010.04.009","volume":"411","author":"L. Becerra-Bonache","year":"2010","unstructured":"Becerra-Bonache, L., Case, J., Jain, S., Stephan, F.: Iterative learning of simple external contextual languages. Theor. Comput. Sci.\u00a0411(29-30), 2741\u20132756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR4","unstructured":"Beick, H.-R.: Induktive Inferenz mit h\u00f6chster Konvergenzgeschwindigkeit. PhD thesis, Sektion Mathematik, Humboldt-Universit\u00e4t Berlin (1984)"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"Case, J.: Periodicity in generations of automata. Math. Syst. Theory\u00a08(1), 15\u201332 (1974)","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J. Case","year":"1994","unstructured":"Case, J.: Infinitary self-reference in learning theory. J. Exp. Theor. Artif. In.\u00a06(1), 3\u201316 (1994)","journal-title":"J. Exp. Theor. Artif. In."},{"issue":"10","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/j.ic.2007.04.001","volume":"205","author":"L. Carlucci","year":"2007","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Results on memory-limited U-shaped learning. Inform. Comput.\u00a0205(10), 1551\u20131573 (2007)","journal-title":"Inform. Comput."},{"key":"25_CR8","unstructured":"Case, J., K\u00f6tzing, T.: Strongly non-U-shaped learning results by general techniques. In: Proc. of COLT 2010, pp. 181\u2013193 (2010)"},{"key":"25_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-87987-9_34","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2008","unstructured":"Case, J., Moelius, S.: Optimal language learning. In: Freund, Y., Gy\u00f6rfi, L., Tur\u00e1n, G., Zeugmann, T. (eds.) ALT 2008. LNCS (LNAI), vol.\u00a05254, pp. 419\u2013433. Springer, Heidelberg (2008)"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.ic.2009.08.001","volume":"208","author":"M. Brecht de","year":"2010","unstructured":"de Brecht, M., Yamamoto, A.: Topological properties of concept spaces (full version). Inform. Comput.\u00a0208(4), 327\u2013340 (2010)","journal-title":"Inform. Comput."},{"issue":"27","key":"25_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/malq.19820282708","volume":"28","author":"R. Freivalds","year":"1982","unstructured":"Freivalds, R., Kinber, E., Wiehagen, R.: Inductive inference and computable one-one numberings. Z. Math. Logik\u00a028(27), 463\u2013479 (1982)","journal-title":"Z. Math. Logik"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. Friedberg","year":"1958","unstructured":"Friedberg, R.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symbolic Logic\u00a023(3), 309\u2013316 (1958)","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M. Fulk","year":"1990","unstructured":"Fulk, M.: Prudence and other conditions on formal language learning. Inform. Comput.\u00a085(1), 1\u201311 (1990)","journal-title":"Inform. Comput."},{"issue":"5","key":"25_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Mark Gold","year":"1967","unstructured":"Mark Gold, E.: Language identification in the limit. Inform. Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Inform. Control"},{"key":"25_CR15","unstructured":"Jain, S.: Private communcation (2010)"},{"issue":"29-30","key":"25_CR16","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1016\/j.tcs.2010.04.010","volume":"411","author":"S. Jain","year":"2010","unstructured":"Jain, S., Lange, S., Moelius, S., Zilles, S.: Incremental learning with temporary memory. Theor. Comput. Sci.\u00a0411(29-30), 2757\u20132772 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"25_CR17","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1016\/j.ic.2008.03.001","volume":"206","author":"S. Jain","year":"2008","unstructured":"Jain, S., Stephan, F.: Learning in Friedberg numberings. Inform. Comput.\u00a0206(6), 776\u2013790 (2008)","journal-title":"Inform. Comput."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(90)90141-4","volume":"74","author":"M. Kummer","year":"1990","unstructured":"Kummer, M.: An easy priority-free proof of a theorem of Friedberg. Theor. Comput. Sci.\u00a074(2), 249\u2013251 (1990)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., Wiehagen, R.: Polynomial time inference of arbitrary pattern languages. New Generat. Comput.\u00a08(4), 361\u2013370 (1991)","journal-title":"New Generat. Comput."},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1006\/jcss.1996.0051","volume":"53","author":"S. Lange","year":"1996","unstructured":"Lange, S., Zeugmann, T.: Incremental learning from positive data. J. Comput. Syst. Sci.\u00a053(1), 88\u2013103 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.tcs.2008.02.030","volume":"397","author":"S. Lange","year":"2008","unstructured":"Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: A survey. Theor. Comput. Sci.\u00a0397(1-3), 194\u2013232 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR22","unstructured":"Moelius, S., Zilles, S.: Learning without coding (2010),(unpublished manuscript), \n                      \n                        http:\/\/www2.cs.uregina.ca\/~zilles\/moeliusZ10TR.pdf"},{"key":"25_CR23","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967); Reprinted, MIT Press (1987)"},{"issue":"10","key":"25_CR24","first-page":"2009","volume":"35","author":"S. Shimozono","year":"1994","unstructured":"Shimozono, S., Shinohara, A., Shinohara, T., Miyano, S., Kuhara, S., Arikawa, S.: Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Trans. Inform. Process. Soc. Jpn.\u00a035(10), 2009\u20132018 (1994)","journal-title":"Trans. Inform. Process. Soc. Jpn."},{"issue":"1\/2","key":"25_CR25","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inform. Process. Cybern. (EIK)\u00a012(1\/2), 93\u201399 (1976)","journal-title":"J. Inform. Process. Cybern. (EIK)"},{"key":"25_CR26","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0023324","volume-title":"Nonmonotonic and Inductive Logic","author":"R. Wiehagen","year":"1991","unstructured":"Wiehagen, R.: A thesis in inductive inference. In: Dix, J., Schmitt, P.H., Jantke, K.P. (eds.) NIL 1990. LNCS (LNAI), vol.\u00a0543, pp. 184\u2013207. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T21:58:53Z","timestamp":1580335133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}