{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:40Z","timestamp":1725664960374},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635772"},{"type":"electronic","value":"9783540696025"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63577-7_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:32:30Z","timestamp":1330281150000},"page":"32-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning of R.E. Languages from good examples"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR2","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"},{"issue":"5","key":"4_CR3","first-page":"273","volume":"51","author":"G. Bahga","year":"1995","unstructured":"G. Bahga, J. Case, and S. Jain. Language learning with some negative information. Journal of Computer and System Sciences, 51(5):273\u2013285, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR4","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":"4_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":"4_CR6","series-title":"DOI Technical Report","volume-title":"Incremental concept learning for bounded data mining","author":"J. Case","year":"1997","unstructured":"J. Case and S. Jain and S. Lange and T. Zeugmann. Incremental concept learning for bounded data mining. DOI Technical Report, DOI-TR-136, Kyushu University, Japan, 1997."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. In Proc. ICALP'92, pages 107\u2013115, LNCS 140, Springer-Verlag, 1982.","DOI":"10.1007\/BFb0012761"},{"key":"4_CR8","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":"4_CR9","volume-title":"On the learnability of recursively enumerable languages from good examples. Technical Report, LSA-97-04E","author":"S. Jain","year":"1997","unstructured":"S. Jain and S. Lange and J. Nessel. On the learnability of recursively enumerable languages from good examples. Technical Report, LSA-97-04E, University Kaiserslautern, Germany, 1997."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"D. de Jongh and M. Kanazawa. Angluin's theorem for indexed families of r.e. sets and applications. In Proc. COLT'96, pages 193\u2013203, ACM Press, 1996.","DOI":"10.1145\/238061.238095"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(93)90353-U","volume":"110","author":"R. Freivalds","year":"1993","unstructured":"R. Freivalds, E. B. Kinber, and R. Wiehagen. On the power of inductive inference from good examples. Theoretical Computer Science, 110:131\u2013144, 1993.","journal-title":"Theoretical Computer Science"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M. A. Fulk","year":"1990","unstructured":"M. A. Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85:1\u201311, 1990.","journal-title":"Information and Computation"},{"key":"4_CR13","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":"4_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jcss.1996.0020","volume":"52","author":"S. A. Goldman","year":"1996","unstructured":"S. A. Goldman and H. D. Mathias. Teaching a smarter learner. Journal of Computer and System Sciences, 52:255\u2013267, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR15","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/inco.1996.2614","volume":"132","author":"S. Jain","year":"1997","unstructured":"S. Jain and A. Sharma. Elementary formal systems, intrinsic complexity and procrastination. Information and Computation, 132:65\u201384, 1997.","journal-title":"Information and Computation"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"S. Lange, J. Nessel, and R. Wiehagen. Language learning from good examples. In Proc. ALT'94, pages 423\u2013437, LNAI 872, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58520-6_81"},{"key":"4_CR18","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Reprinted by MIT Press, Cambridge, Massachusetts in 1987."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In Algorithmic Learning for Knowledge-Based Systems, pages 190\u2013258, LNAI 961, Springer-Verlag, 1995. *** DIRECT SUPPORT *** A0008157 00002","DOI":"10.1007\/3-540-60217-8_12"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63577-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:25:16Z","timestamp":1558254316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63577-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635772","9783540696025"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-63577-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}