{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:09Z","timestamp":1725750309433},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_9","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T05:14:50Z","timestamp":1380258890000},"page":"113-127","source":"Crossref","is-referenced-by-count":1,"title":["Partial Learning of Recursively Enumerable Languages"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_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":"9_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":"9_CR3","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol.\u00a01, pp. 82\u201388. Latvian State University (1974) (in Russian)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-04414-4_23","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2009","unstructured":"Case, J., K\u00f6tzing, T.: Difficulties in forcing fairness of polynomial time inductive inference. In: Gavald\u00e0, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds.) ALT 2009. LNCS, vol.\u00a05809, pp. 263\u2013277. Springer, Heidelberg (2009)"},{"key":"9_CR5","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)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science\u00a025, 193\u2013220 (1983)","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-39053-1_21","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"Z. Gao","year":"2013","unstructured":"Gao, Z., Jain, S., Stephan, F.: On conservative learning of recursively enumerable languages. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol.\u00a07921, pp. 181\u2013190. Springer, Heidelberg (2013)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-27654-5_10","volume-title":"Computation, Physics and Beyond","author":"Z. Gao","year":"2012","unstructured":"Gao, Z., Stephan, F., Wu, G., Yamamoto, A.: Learning families of closed sets in matroids. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) WTCS 2012 (Calude Festschrift). LNCS, vol.\u00a07160, pp. 120\u2013139. Springer, Heidelberg (2012)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-34106-9_8","volume-title":"Algorithmic Learning Theory","author":"Z. Gao","year":"2012","unstructured":"Gao, Z., Stephan, F.: Confident and consistent partial learning of recursive functions. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS, vol.\u00a07568, pp. 51\u201365. Springer, Heidelberg (2012)"},{"key":"9_CR10","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. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that learn: an introduction to learning theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that learn: an introduction to learning theory. MIT Press, Cambridge (1999)"},{"key":"9_CR12","unstructured":"Jain, S., Stephan, F.: Consistent partial identification. In: COLT 2009, pp. 135\u2013145 (2009)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"de Jongh, D., Kanazawa, M.: Angluin\u2019s theorem for indexed families of r.e. sets and applications. In: Proceedings of the Ninth Annual Conference on Computational Learning Theory, pp. 193\u2013204. ACM Press (1996)","DOI":"10.1145\/238061.238095"},{"key":"9_CR14","volume-title":"Systems that learn: an introduction to learning theory for cognitive and computer scientists","author":"D.N. Osherson","year":"1986","unstructured":"Osherson, D.N., Stob, M., Weinstein, S.: Systems that learn: an introduction to learning theory for cognitive and computer scientists. MIT Press, Cambridge (1986)"},{"key":"9_CR15","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS (LNAI), vol.\u00a0397, pp. 18\u201344. Springer, Heidelberg (1989)"},{"key":"9_CR16","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":"9_CR17","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60217-8_1","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"R. Wiehagen","year":"1995","unstructured":"Wiehagen, R., Zeugmann, T.: Learning and consistency. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol.\u00a0961, pp. 1\u201324. Springer, Heidelberg (1995)"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1995.1107","volume":"120","author":"T. Zeugmann","year":"1995","unstructured":"Zeugmann, T., Lange, S., Kapur, S.: Characterizations of monotonic and dual monotonic language learning. Information and Computation\u00a0120(2), 155\u2013173 (1995)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:54:16Z","timestamp":1596581656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}