{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:25:45Z","timestamp":1648985145710},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00132-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:37:27Z","timestamp":1027622247000},"page":"31-56","source":"Crossref","is-referenced-by-count":2,"title":["Synthesizing noise-tolerant language learners"],"prefix":"10.1016","volume":"261","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":"78","reference":[{"key":"10.1016\/S0304-3975(00)00132-8_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB2","series-title":"Synthesizing enumeration techniques for language learning, Proc. 9th Annual Conf. on Computational Learning Theory","first-page":"169","author":"Baliga","year":"1996"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB3","unstructured":"J. B\u0101rzdi\u0146\u0161, Two theorems on the limiting synthesis of functions, in: Theory of Algorithms and Programs, vol. 1, Latvian State University, 1974, pp. 82\u201388 (in Russian)."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB4","unstructured":"J. B\u0101rzdi\u0146\u0161, K. Podnieks, The theory of inductive inference, in: Mathematical Foundations of Computer Science, Math. Inst. of the Slovak Academy of Sciences, 1973, pp. 9\u201315."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB5","series-title":"The Acquisition of Syntactic Knowledge","author":"Berwick","year":"1985"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01761704","article-title":"Periodicity in generations of automata","volume":"8","author":"Case","year":"1974","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/S0304-3975(00)00132-8_BIB9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/09528139408953778","article-title":"Infinitary self-reference in learning theory","volume":"6","author":"Case","year":"1994","journal-title":"J. Experimental Theoret. Artif. Intell."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB10","unstructured":"J. Case, The power of vacillation in language learning, Tech. Rep. LP-96-08, Logic, Philosophy and Linguistics Series of the Institute for Logic, Language and Computation, University of Amsterdam, 1996."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB11","first-page":"285","article-title":"Vacillatory and BC learning on noisy data","volume":"vol. 1160","author":"Case","year":"1996"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB12","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"vol. 140","author":"Case","year":"1982"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB14","doi-asserted-by":"crossref","unstructured":"D. de Jongh, M. Kanazawa, Angluin's thoerem for indexed families of r.e. sets and applications, Proc. 9th Annual Conf. on Computational Learning Theory, ACM Press, New York, July 1996, pp. 193\u2013204.","DOI":"10.1145\/238061.238095"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB15","doi-asserted-by":"crossref","unstructured":"M. Fulk, Robust separations in inductive inference, Proc. 31st Annual IEEE Symp. on Foundations of Computer Science, 1990, pp. 405\u2013410.","DOI":"10.1109\/FSCS.1990.89560"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB16","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"issue":"1","key":"10.1016\/S0304-3975(00)00132-8_BIB17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0022-0000(05)80088-1","article-title":"Characterizing language learning by standardizing operations","volume":"49","author":"Jain","year":"1994","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/S0304-3975(00)00132-8_BIB18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0168-0072(95)00064-X","article-title":"Characterizing language learning in terms of computable numberings","volume":"84","author":"Jain","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB19","unstructured":"K. Jantke, Automatic synthesis of programs and inductive inference of functions, Internat. Conf. Fundamentals of Computations Theory, 1979, pp. 219\u2013225."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB20","unstructured":"S. Kapur, Computational learning of languages, Ph.D. Thesis, Cornell University, 1991."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB21","volume":"vol. 577","author":"Kapur","year":"1992"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0304-3975(95)00284-7","article-title":"Monotonic and dual monotonic language learning","volume":"155","author":"Lange","year":"1996","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB23","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi, Characterization of finite identification, in: K. Jantke (Ed.) Analogical and Inductive Inference, Proc. 3rd Internat. Workshop, 1992, pp. 260\u2013267.","DOI":"10.1007\/3-540-56004-1_18"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB24","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB25","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0890-5401(88)90055-7","article-title":"Synthesising inductive expertise","volume":"77","author":"Osherson","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","article-title":"Inferring unions of two pattern languages","volume":"20","author":"Shinohara","year":"1983","journal-title":"Bull. Inform. Cybernet."},{"key":"10.1016\/S0304-3975(00)00132-8_BIB27","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB28","first-page":"185","volume":"vol. 997","author":"Stephan","year":"1995"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB29","first-page":"190","article-title":"A guided tour across the boundaries of learning recursive languages","volume":"vol. 961","author":"Zeugmann","year":"1995"},{"key":"10.1016\/S0304-3975(00)00132-8_BIB30","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1995.1107","article-title":"Characterizations of monotonic and dual monotonic language learning","volume":"120","author":"Zeugmann","year":"1995","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T22:13:23Z","timestamp":1620598403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001328"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00132-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}