{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:50Z","timestamp":1725664970592},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635772"},{"type":"electronic","value":"9783540696025"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63577-7_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:31:53Z","timestamp":1330299113000},"page":"228-243","source":"Crossref","is-referenced-by-count":2,"title":["Synthesizing noise-tolerant language learners"],"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"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"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","first-page":"82","volume":"210","author":"J. Barzdin","year":"1974","unstructured":"J. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974.","journal-title":"In Theory of Algorithms and Programs, Latvian State University, Riga"},{"key":"16_CR3","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_CR4","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, Desenzano del Garda, Italy, pages 169\u2013180. ACM Press, July 1996.","DOI":"10.1145\/238061.238090"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1074.001.0001","volume-title":"The Acquisition of Syntactic Knowledge","author":"R. Berwick","year":"1985","unstructured":"R. Berwick. The Acquisition of Syntactic Knowledge. MIT Press, Cambridge, MA, 1985."},{"key":"16_CR6","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_CR7","unstructured":"J. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, 1973."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/09528139408953778","volume":"6","author":"J. Case","year":"1994","unstructured":"J. Case. Infinitary self-reference in learning theory. Journal of Experimental and Theoretical Artificial Intelligence, 6:3\u201316, 1994.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"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 F. Stephan. Vacillatory and BC learning on noisy data. In S. Arikawa and A. Sharma, editors, Proceedings of the Seventh International Workshop on Algorithmic Learning Theory, Sydney, Australia, pages 285\u2013298. Springer Verlag, October 1996.","DOI":"10.1007\/3-540-61863-5_53"},{"key":"16_CR12","doi-asserted-by":"crossref","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. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140, pages 107\u2013115. Springer-Verlag, Berlin, 1982."},{"key":"16_CR13","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_CR14","doi-asserted-by":"crossref","unstructured":"D. de Jongh and M. Kanazawa. Angluin's thoerem for indexed families of r.e. sets and applications. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, Desenzano del Garda, Italy, pages 193\u2013204. ACM Press, July 1996.","DOI":"10.1145\/238061.238095"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"M. Fulk. Robust separations in inductive inference. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 405\u2013410, St. Louis, Missouri 1990.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"E. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"16_CR17","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_CR18","unstructured":"S. Kapur. Computational Learning of Languages. PhD thesis, Dept. of Computer Science, Cornell University, 1991."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"S. Kapur and G. Bilardi. Language learning without overgeneralization. In Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 577. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55210-3_188"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"S. Lange and T. Zeugmann. Types of monotonic language learning and their characterization. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania, pages 377\u2013390. ACM Press, 1992.","DOI":"10.1145\/130385.130427"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"S. Lange, T. Zeugmann, and S. Kapur. Monotonic and dual monotonic language learning. Theoretical Computer Science A, 1995. To appear.","DOI":"10.1006\/inco.1995.1107"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi. Characterization of finite identification. In K. P. Jantke, editor, Proceedings of the Third International Workshop on Analogical and Inductive Inference, Dagstuhl Castle, Germany, pages 260\u2013267, October 1992.","DOI":"10.1007\/3-540-56004-1_18"},{"key":"16_CR23","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"16_CR24","doi-asserted-by":"crossref","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. Synthesizing inductive expertise. Information and Computation, 77:138\u2013161, 1988.","journal-title":"Information and Computation"},{"key":"16_CR25","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_CR26","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_CR27","doi-asserted-by":"crossref","unstructured":"F. Stephan. Noisy inference and oracles. In Algorithmic Learning Theory, 6th International Workshop, ALT'95, Fukuoka, Japan, pages 185\u2013200. Springer-Verlag, October 1995. Lecture Notes in Artificial Intelligence 997.","DOI":"10.1007\/3-540-60454-5_38"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In Klaus P. Jantke and Steffen 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"},{"issue":"2","key":"16_CR29","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1995.1107","volume":"120","author":"T. Zeugmann","year":"1995","unstructured":"Thomas Zeugmann, Steffen Lange, and Shyam Kapur. Characterizations of monotonic and dual monotonic language learning. Information and Computation, 120(2):155\u2013173, August 1 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-63577-7_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:43Z","timestamp":1619574283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63577-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635772","9783540696025"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-63577-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}