{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T07:10:19Z","timestamp":1742627419670,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_22","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"252-263","source":"Crossref","is-referenced-by-count":0,"title":["Learnability of Co-r.e. Classes"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045(2), 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1006\/inco.1998.2782","volume":"152","author":"G. Baliga","year":"1999","unstructured":"Baliga, G., Case, J., Jain, S.: The synthesis of language learners. Information and Computation\u00a0152, 16\u201343 (1999)","journal-title":"Information and Computation"},{"key":"22_CR3","first-page":"1224","volume":"13","author":"J. B\u0101rzdi\u0146\u0161","year":"1972","unstructured":"B\u0101rzdi\u0146\u0161, J., Freivalds, R.: On the prediction of general recursive functions. Soviet Mathematical Doklady\u00a013, 1224\u20131228 (1972)","journal-title":"Soviet Mathematical Doklady"},{"key":"22_CR4","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.: Towards a mathematical theory of inductive inference. Information and Control\u00a028, 125\u2013155 (1975)","journal-title":"Information and Control"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.2178\/jsl\/1243948324","volume":"74","author":"L. Carlucci","year":"2009","unstructured":"Carlucci, L., Case, J., Jain, S.: Learning correction grammars. The Journal of Symbolic Logic\u00a074, 489\u2013516 (2009)","journal-title":"The Journal of Symbolic Logic"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J. Case","year":"1999","unstructured":"Case, J.: The power of vacillation in language learning. SIAM Journal on Computing\u00a028(6), 1941\u20131969 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1142\/S0129054192000097","volume":"3","author":"J. Case","year":"1992","unstructured":"Case, J., Jain, S., Sharma, A.: On learning limiting programs. International Journal of Foundations of Computer Science\u00a03, 93\u2013115 (1992)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Automata, Languages, and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine Inductive Inference and Language Identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1037\/h0083207","volume":"15","author":"V. Freibergs","year":"1961","unstructured":"Freibergs, V., Tulving, E.: The effect of practice on utilization of information from positive and negative instances in concept identification. Canadian Journal of Psychology\u00a015(2), 101\u2013106 (1961)","journal-title":"Canadian Journal of Psychology"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M.A. Fulk","year":"1990","unstructured":"Fulk, M.A.: Prudence and other conditions on formal language learning. Information and Computation\u00a085(1), 1\u201311 (1990)","journal-title":"Information and Computation"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"19","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1796","DOI":"10.1016\/j.tcs.2009.01.011","volume":"410","author":"S. Jain","year":"2009","unstructured":"Jain, S., Stephan, F., Ye, N.: Prescribed learning of r.e. classes. Theoretical Computer Science\u00a0410(19), 1796\u20131806 (2009)","journal-title":"Theoretical Computer Science"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Jongh, D.D., Kanazawa, M.: Angluin\u2019s theorem for indexed families of r.e. sets and applications. In: COLT, pp. 193\u2013204 (1996)","DOI":"10.1145\/238061.238095"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/S0022-5371(70)80028-7","volume":"9","author":"M.J. Krebs","year":"1970","unstructured":"Krebs, M.J., Lovelace, E.A.: Disjunctive concept identification: stimulus complexity and positive versus negative instances. Journal of Verbal Learning and Verbal Behaviour\u00a09, 653\u2013657 (1970)","journal-title":"Journal of Verbal Learning and Verbal Behaviour"},{"issue":"6","key":"22_CR15","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/BF01301967","volume":"29","author":"S. Lange","year":"1996","unstructured":"Lange, S., Zeugmann, T.: Set-driven and rearrangement-independent learning of recursive languages. Mathematical Systems Theory\u00a029(6), 599\u2013634 (1996)","journal-title":"Mathematical Systems Theory"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1995.1107","volume":"120","author":"S. Lange","year":"1995","unstructured":"Lange, S., Zeugmann, T., Kapur, S.: Characterizations of monotonic and dual monotonic language learning. Information and Computation\u00a0120(2), 155\u2013173 (1995)","journal-title":"Information and Computation"},{"issue":"1-3","key":"22_CR17","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. Theoretical Computer Science\u00a0397(1-3), 194\u2013232 (2008)","journal-title":"Theoretical Computer Science"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(82)91097-X","volume":"53","author":"D. Osherson","year":"1982","unstructured":"Osherson, D., Stob, M., Weinstein, S.: Learning strategies. Information and Control\u00a053, 32\u201351 (1982)","journal-title":"Information and Control"},{"key":"22_CR19","volume-title":"Conjectures and refutations: the growth of scientific knowledge","author":"K.R. Popper","year":"1972","unstructured":"Popper, K.R.: Conjectures and refutations: the growth of scientific knowledge. Routledge and Kegan Paul, London (1972)"},{"key":"22_CR20","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. MIT Press, Cambridge (1987)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-60217-8_12","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"T. Zeugmann","year":"1995","unstructured":"Zeugmann, T., Lange, S.: A Guided Tour Across the Boundaries of Learning Recursive Languages. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS, vol.\u00a0961, pp. 190\u2013258. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T06:19:51Z","timestamp":1742624391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}