{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T22:22:05Z","timestamp":1699914125635},"reference-count":21,"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)00131-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:37:27Z","timestamp":1027607847000},"page":"3-29","source":"Crossref","is-referenced-by-count":7,"title":["On the learnability of recursively enumerable languages from good examples"],"prefix":"10.1016","volume":"261","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Nessel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00131-6_BIB1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB2","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)00131-6_BIB3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jcss.1995.1066","article-title":"Language learning with some negative information","volume":"51","author":"Baliga","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB4","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)00131-6_BIB5","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)00131-6_BIB6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/inco.1998.2784","article-title":"Incremental concept learning for bounded data mining","volume":"152","author":"Case","year":"1999","journal-title":"Information and Computation"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB7","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"vol. 140","author":"Case","year":"1982"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB8","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB9","series-title":"Proc. 9th Annual Conf. on Computational Learning Theory","first-page":"193","article-title":"Angluin's theorem for indexed families of r.e. sets and applications","author":"de Jongh","year":"1996"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(93)90353-U","article-title":"On the power of inductive inference from good examples","volume":"110","author":"Freivalds","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","article-title":"Prudence and other conditions on formal language learning","volume":"85","author":"Fulk","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB12","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"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB13","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jcss.1996.0020","article-title":"Teaching a smarter learner","volume":"52","author":"Goldman","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/inco.1996.2614","article-title":"Elementary formal systems, intrinsic complexity and procrastination","volume":"132","author":"Jain","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1018955906119","article-title":"Learning Recursive Languages from Good Examples","volume":"23","author":"Lange","year":"1998","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(91)90176-I","article-title":"Inductive inference from all positive and some negative data","volume":"39","author":"Motoki","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB17","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967 (reprinted by MIT Press, Cambridge, MA, 1987)."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB18","unstructured":"G. Sch\u00e4fer-Richter, \u00dcber Eingabeabh\u00e4ngigkeit und Komplexit\u00e4t von Inferenzstrategien, Dissertation, Rheinisch Westf\u00e4lische Technische Hochschule Aachen, 1984."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF03037091","article-title":"Teachability in computational learning","volume":"8","author":"Shinohara","year":"1991","journal-title":"New Generation Comput."},{"key":"10.1016\/S0304-3975(00)00131-6_BIB20","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1018964207937","article-title":"Lange and Wiehagen's pattern language learning algorithm","volume":"23","author":"Zeugmann","year":"1998","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00131-6_BIB21","first-page":"190","article-title":"A guided tour across the boundaries of learning recursive languages","volume":"vol. 961","author":"Zeugmann","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:29:57Z","timestamp":1556018997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001316"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00131-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}