{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:03Z","timestamp":1759638783247},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650133"},{"type":"electronic","value":"9783540497301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49730-7_16","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:01:18Z","timestamp":1196330478000},"page":"205-219","source":"Crossref","is-referenced-by-count":2,"title":["Synthesizing Learners Tolerating Computable Noisy Data"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117\u2013135, 1980.","journal-title":"Information and Control"},{"key":"16_CR2","unstructured":"H. Arimura and T. Shinohara. Inductive inference of Prolog programs with linear data dependency from positive data. In Proc. Information Modelling and Knowledge Bases V, pages 365\u2013375. IOS Press, 1994."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science, 95:97\u2013113, 1992.","journal-title":"Theoretical Computer Science"},{"key":"16_CR4","first-page":"82","volume":"1","author":"7.4._.J. B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"74._J. B\u0101rzdi\u0146\u0161. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, vol. 1, pages 82\u201388. Latvian State University, 1974. In Russian.","journal-title":"Theory of Algorithms and Programs"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"G. Baliga, J. Case, and S. Jain. Synthesizing enumeration techniques for language learning. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 169\u2013180. ACM Press, 1996.","DOI":"10.1145\/238061.238090"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"R. Berwick. The Acquisition of Syntactic Knowledge. MIT Press, 1985.","DOI":"10.7551\/mitpress\/1074.001.0001"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"16_CR9","unstructured":"J. Case. Learning machines. In W. Demopoulos and A. Marras, editors, Language Learning and Concept Acquisition. Ablex Publishing Company, 1986."},{"key":"16_CR10","unstructured":"J. Case. The power of vacillation in language learning. Technical Report LP-96-08, Logic, Philosophy and Linguistics Series of the Institute for Logic, Language and Computation, University of Amsterdam, 1996. To appear revised in SIAM Journal on Computing."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"J. Case, S. Jain, and A. Sharma. Synthesizing noise-tolerant language learners. Theoretical Computer Science A, 1998. Accepted.","DOI":"10.1007\/3-540-63577-7_46"},{"key":"16_CR12","unstructured":"J. Case, S. Jain, and F. Stephan. Vacillatory and BC learning on noisy data. Theoretical Computer Science A, 1998. Accepted."},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Proceedings of the 9th International Colloquium on Automata, Languages and Programming","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. In M. Nielsen and E. M. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 107\u2013115. Springer-Verlag, 1982."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"D. de Jongh and M. Kanazawa. Angluin\u2019s thoerem for indexed families of r.e. sets and applications. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 193\u2013204. ACM Press, July 1996.","DOI":"10.1145\/238061.238095"},{"key":"16_CR16","first-page":"35","volume":"27","author":"R. Freivalds","year":"1985","unstructured":"R. Freivalds. Recursiveness of the enumerating functions increases the inferrability of recursively enumerable sets. Bulletin of the European Association for Theoretical Computer Science, 27:35\u201340, 1985.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"M. Fulk. Robust separations in inductive inference. 31st Annual IEEE Symposium on Foundations of Computer Science, pages 405\u2013410, 1990.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"16_CR18","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. M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"16_CR19","unstructured":"K. Jantke. Automatic synthesis of programs and inductive inference of functions. In Int. Conf. Fundamentals of Computations Theory, pages 219\u2013225, 1979."},{"key":"16_CR20","first-page":"487","volume":"15","author":"K. Jantke","year":"1979","unstructured":"K. Jantke. Natural properties of strategies identifying recursive functions. Electronische Informationverarbeitung und Kybernetik, 15:487\u2013496, 1979.","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"16_CR21","unstructured":"S. Kapur. Computational Learning of Languages. PhD thesis, Cornell University, 1991."},{"key":"16_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55602-8","volume-title":"Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science","author":"S. Kapur","year":"1992","unstructured":"S. Kapur and G. Bilardi. Language learning without overgeneralization. In Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, volume 577 of Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"16_CR23","unstructured":"N. Lavarafi\u010d and S. D\u017deroski. Inductive Logic Programming. Ellis Horwood, New York, 1994."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0304-3975(95)00284-7","volume":"155","author":"S. Lange","year":"1996","unstructured":"S. Lange, T. Zeugmann, and S. Kapur. Monotonic and dual monotonic language learning. Theoretical Computer Science A, 155:365\u2013410, 1996.","journal-title":"Theoretical Computer Science A"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19\/20:669\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi. Characterization of finite identification. In K. Jantke, editor, Analogical and Inductive Inference, Proceedings of the Third International Workshop, pages 260\u2013267, 1992.","DOI":"10.1007\/3-540-56004-1_18"},{"key":"16_CR27","volume-title":"Technical Report 280","author":"R. Nix","year":"1983","unstructured":"R. Nix. Editing by examples. Technical Report 280, Department of Computer Science, Yale University, New Haven, CT, USA, 1983."},{"key":"16_CR28","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0890-5401(88)90055-7","volume":"77","author":"D. Osherson","year":"1988","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Synthesising inductive expertise. Information and Computation, 77:138\u2013161, 1988.","journal-title":"Information and Computation"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"J. Royer and J. Case. Subrecursive programming systems: Complexity & succinctness. Birkh\u00c4user, 1994.","DOI":"10.1007\/978-1-4612-0249-3"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"T. Shinohara and A. Arikawa. Pattern inference. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 259\u2013291. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60217-8_13"},{"key":"16_CR32","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2307\/2270310","volume":"36","author":"N. Shapiro","year":"1971","unstructured":"N. Shapiro. Review of \u201cLimiting recursion\u201d by E.M. Gold and \u201cTrial and error predicates and the solution to a problem of Mostowski\u201d by H. Putnam. Journal of Symbolic Logic, 36:342, 1971.","journal-title":"Journal of Symbolic Logic"},{"key":"16_CR33","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","volume":"20","author":"T. Shinohara","year":"1983","unstructured":"T. Shinohara. Inferring unions of two pattern languages. Bulletin of Informatics and Cybernetics, 20:83\u201388, 1983.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"16_CR34","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"T. Shinohara. Inductive inference of monotonic formal systems from positive data. New Generation Computing, 8:371\u2013384, 1991.","journal-title":"New Generation Computing"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"R. Smullyan. Theory of Formal Systems, Annals of Mathematical Studies, No. 47. Princeton, NJ, 1961.","DOI":"10.1515\/9781400882007"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"R. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"16_CR37","first-page":"2009","volume":"35","author":"S. Shimozono","year":"1994","unstructured":"S. Shimozono, A. Shinohara, T. Shinohara, S. Miyano, S. Kuhara, and S. Arikawa. Knowledge acquisition from amino acid sequences by machine learning system BONSAI. Trans. Information Processing Society of Japan, 35:2009\u20132018, 1994.","journal-title":"Trans. Information Processing Society of Japan"},{"key":"16_CR38","doi-asserted-by":"crossref","unstructured":"F. Stephan. Noisy inference and oracles. In Algorithmic Learning Theory: Sixth International Workshop (ALT\u2019 95), volume 997 of Lecture Notes in ArtiFficial Intelligence, pages 185\u2013200. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60454-5_38"},{"key":"16_CR39","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":"R. 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."},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"K. Wright. Identification of unions of languages drawn from an identifiable class. In R. Rivest, D. Haussler, and M.K. Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory, Santa Cruz, California, pages 328\u2013333. Morgan Kaufmann Publishers, Inc., 1989.","DOI":"10.1016\/B978-0-08-094829-4.50026-X"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In K. Jantke and S. Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 190\u2013258. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60217-8_12"},{"key":"16_CR42","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1995.1107","volume":"120","author":"T. Zeugmann","year":"1995","unstructured":"T. Zeugmann, S. Lange, and S. Kapur. Characterizations of monotonic and dual monotonic language learning. Information and Computation, 120: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\/3-540-49730-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T22:38:12Z","timestamp":1588113492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49730-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650133","9783540497301"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-49730-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}