{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:54Z","timestamp":1725664554451},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620648"},{"type":"electronic","value":"9783540496373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62064-8_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:26Z","timestamp":1330295546000},"page":"122-133","source":"Crossref","is-referenced-by-count":4,"title":["Co-learning of recursive languages from positive data"],"prefix":"10.1007","author":[{"given":"Rusins","family":"Freivalds","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Zeugmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980), Finding patterns common to a set of strings, Journal of Computer and System Sciences, 21, 46\u201362.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, 117\u2013135.","journal-title":"Information and Control"},{"key":"12_CR3","first-page":"190","volume-title":"Co-learning of total recursive functions","author":"R. Freivalds","year":"1994","unstructured":"Freivalds, R., Karpinski, M., and Smith, C.H. (1994), Co-learning of total recursive functions, in \u201cProc. 7th Ann. ACM Conf. Computational Learning Theory,\u201d pp. 190\u2013197, ACM Press, New York."},{"key":"12_CR4","first-page":"100","volume-title":"Lecture Notes in Artificial Intelligence 872","author":"R. Freivalds","year":"1994","unstructured":"Freivalds, R., Gobleja, D., Karpinski, M., and Smith, C.H. (1994), Co-learnability and FIN-identifiability of enumerable classes of total recursive functions, in \u201cProc. 4th International Workshop on Analogical and Inductive Inference \u2014 AII94,\u201d Lecture Notes in Artificial Intelligence 872, pp. 100\u2013105, Springer-Verlag, Berlin."},{"key":"12_CR5","unstructured":"Freivalds, R., and Zeugmann, T. (1995), Co-learning of recursive languages from positive data, RIFIS-TR-CS-110, RIFIS, Kyushu University 33, April 20."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M. (1967), Language identification in the limit, Information and Control 10, 447\u2013474.","journal-title":"Information and Control"},{"key":"12_CR7","first-page":"57","volume-title":"A polynomial-time algorithm for learning k-variable pattern languages from examples, in","author":"M. Kearns","year":"1989","unstructured":"Kearns, M., and Pitt, L. (1989), A polynomial-time algorithm for learning k-variable pattern languages from examples, in \u201cProc. 2nd Ann. Workshop on Computational Learning Theory,\u201d pp. 57\u201371, Morgan Kaufmann Publ. Inc., San Mateo."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(95)00036-C","volume":"54","author":"M. Kummer","year":"1995","unstructured":"Kummer, M. (1995), A learning-theoretic characterization of classes of recursive functions, Information Processing Letters 54, 205\u2013211.","journal-title":"Information Processing Letters"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., and Wiehagen, R. (1991), Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8, 361\u2013370.","journal-title":"New Generation Computing"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Lange, S., Wiehagen, R. and Zeugmann, T. (1996), Learning by Erasing, RIFIS-TR-CS-122, RIFIS, Kyushu University 33, February 13.","DOI":"10.1007\/3-540-61863-5_49"},{"key":"12_CR11","first-page":"254","volume-title":"Lecture Notes in Artificial Intelligence Vol. 659","author":"S. Lange","year":"1993","unstructured":"Lange, S., and Zeugmann, T. (1993), Monotonic versus non-monotonic language learning, in \u201cProceedings 2nd International Workshop on Nonmonotonic and Inductive Logic, December 1991, Reinhardsbrunn,\u201d (G. Brewka, K.P. Jantke and P.H. Schmitt, Eds.), Lecture Notes in Artificial Intelligence Vol. 659, pp. 254\u2013269, Springer-Verlag, Berlin."},{"key":"12_CR12","first-page":"127","volume-title":"Language learning in dependence on the space of hypotheses","author":"S. Lange","year":"1993","unstructured":"Lange, S., and Zeugmann, T. (1993), Language learning in dependence on the space of hypotheses, in \u201cProc. 6th Ann. ACM Conf. Computational Learning Theory,\u201d pp. 127\u2013136, ACM Press, New York."},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S0129054193000110","volume":"4","author":"S. Lange","year":"1993","unstructured":"Lange, S., and Zeugmann, T. (1993), Learning recursive languages with bounded mind changes, International Journal of Foundations of Computer Science 4, 157\u2013178.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"12_CR14","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"Osherson, D., Stob, M., and Weinstein, S. (1986), \u201cSystems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists,\u201d MIT-Press, Cambridge, Massachusetts."},{"key":"12_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, H.Jr. (1967), \u201cTheory of Recursive Functions and Effective Computability\u201d, McGraw-Hill, New York."},{"key":"12_CR16","first-page":"415","volume":"E-75D","author":"M. Sato","year":"1992","unstructured":"Sato, M., and Umayahara, K. (1992), Inductive inferability for formal languages from positive data, IEICE Transactions on Information and Systems E-75D, 415\u2013419.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"12_CR17","first-page":"115","volume-title":"Lecture Notes in Computer Science 147","author":"T. Shinohara","year":"1982","unstructured":"Shinohara, T. (1982), Polynomial time inference of extended regular pattern languages, in \u201cProc. RIMS Symposia on Software Science and Engineering,\u201d Kyoto, Lecture Notes in Computer Science 147, pp. 115\u2013127, Springer-Verlag, Berlin."},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/09528139408953785","volume":"6","author":"R. Wiehagen","year":"1994","unstructured":"Wiehagen, R., and Zeugmann, T. (1994), Ignoring data may be the only way to learn efficiently, Journal of Theoretical and Experimental Artificial Intelligence 6, 131\u2013144.","journal-title":"Journal of Theoretical and Experimental Artificial Intelligence"},{"key":"12_CR19","unstructured":"Zeugmann, T. (1995), Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time, RIFIS-TR-CS-111, RIFIS, Kyushu University 33, April 20, 1995."},{"issue":"No.2","key":"12_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1995.1107","volume":"120","author":"T. Zeugmann","year":"1995","unstructured":"Zeugmann, T., Lange, S., and Kapur, S. (1995), Characterizations of monotonic and dual monotonic language learning, Information and Computation 120, No. 2, 1995, 155\u2013173.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62064-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:43Z","timestamp":1605647503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62064-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620648","9783540496373"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-62064-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}