{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:07Z","timestamp":1747548607694,"version":"3.40.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1023\/a:1018955906119","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"27-52","source":"Crossref","is-referenced-by-count":7,"title":["Learning recursive languages from good examples"],"prefix":"10.1007","volume":"23","author":[{"given":"Steffen","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jochen","family":"Nessel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Wiehagen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325489_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 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"325489_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1007\/3-540-56503-5_66","volume-title":"Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science","author":"G. Baliga","year":"1993","unstructured":"G. Baliga, J. Case and S. Jain, Language learning with some negative information, in: Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 665 (Springer, Berlin, 1993) pp. 672\u2013681."},{"key":"325489_CR3","doi-asserted-by":"crossref","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 Association for Computing Machinery 14 (1967) 322\u2013336.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"325489_CR4","volume-title":"Theory of Numberings","author":"Y. Er\u0161ov","year":"1977","unstructured":"Yu.L. Er\u0161ov, Theory of Numberings (Nauka, Moscow, 1977) (in Russian)."},{"key":"325489_CR5","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Proc. 2nd Intern. Workshop on Analogical and Inductive Inference","author":"R. Freivalds","year":"1989","unstructured":"R. Freivalds, E.B. Kinber and R. Wiehagen, Inductive inference from good examples, in: Proc. 2nd Intern. Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397 (Springer, Berlin, 1989) pp. 1\u201317."},{"key":"325489_CR6","doi-asserted-by":"publisher","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 (1993) 131\u2013144.","journal-title":"Theoretical Computer Science"},{"key":"325489_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. Friedberg","year":"1958","unstructured":"R. Friedberg, Three theorems on recursive enumeration, Journal of Symbolic Logic 23 (1958) 309\u2013316.","journal-title":"Journal of Symbolic Logic"},{"key":"325489_CR8","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 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"325489_CR9","first-page":"67","volume-title":"Proc. 6th Annual ACM Conference on Computational Learning Theory","author":"S.A. Goldman","year":"1993","unstructured":"S.A. Goldman and H.D. Mathias, Teaching a smarter learner, in: Proc. 6th Annual ACM Conference on Computational Learning Theory (ACM Press, New York, 1993) pp. 67\u201376."},{"key":"325489_CR10","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata (Addison-Wesley, Reading, MA, 1969)."},{"key":"325489_CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"S. Lange and R. Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8 (1991) 361\u2013370.","journal-title":"New Generation Computing"},{"key":"325489_CR12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/130385.130427","volume-title":"Proc. 5th Annual ACM Workshop on Computational Learning Theory","author":"S. Lange","year":"1992","unstructured":"S. Lange and T. Zeugmann, Types of monotonic language learning and their characterization, in: Proc. 5th Annual ACM Workshop on Computational Learning Theory (ACM Press, New York, 1992) pp. 377\u2013390."},{"key":"325489_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(91)90176-I","volume":"39","author":"T. Motoki","year":"1991","unstructured":"T. Motoki, Inductive inference from all positive and some negative data, Information Processing Letters 39 (1991) 177\u2013182.","journal-title":"Information Processing Letters"},{"key":"325489_CR14","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob and S. Weinstein, Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists (MIT Press, Cambridge, MA, 1986)."},{"key":"325489_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1987","unstructured":"H. Rogers, Jr., Theory of Recursive Functions and Effective Computability (MIT Press, Cambridge, MA, 1987)."},{"key":"325489_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF03037091","volume":"8","author":"A. Shinohara","year":"1991","unstructured":"A. Shinohara and S. Miyano, Teachability in computational learning, New Generation Computing 8 (1991) 337\u2013347.","journal-title":"New Generation Computing"},{"key":"325489_CR17","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF03037350","volume":"12","author":"R. Wiehagen","year":"1994","unstructured":"R. Wiehagen, From inductive inference to algorithmic learning theory, New Generation Computing 12 (1994) 321\u2013335.","journal-title":"New Generation Computing"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018955906119.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018955906119\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018955906119.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:38:52Z","timestamp":1747546732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018955906119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["325489"],"URL":"https:\/\/doi.org\/10.1023\/a:1018955906119","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}