{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:25:03Z","timestamp":1743006303926,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45583-3_19","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"235-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Languages in a Union"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yen Kaow","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiong Seng","family":"Tay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"19_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:117\u2013135,1980.","journal-title":"Information and Control"},{"key":"19_CR2","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":"19_CR3","unstructured":"H.S.M. Coxeter. Regular Polytopes (2nd ed.). Methuen & Co. Ltd.,London, 1963."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1006\/inco.1995.1158","volume":"123","author":"R. Freivalds","year":"1995","unstructured":"R. Freivalds, E. Kinber,and C. Smith. On the intrinsic complexity of learning. Information and Computation,123(1):64\u201371,1995.","journal-title":"Information and Computation"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"S. Goldman and S. Kwek. On learning unions of pattern languages and tree patterns. Algorithmic Learning Theory:T enth International Conference (ALT\u2019 99),1720:347\u2013363,1999.","DOI":"10.1007\/3-540-46769-6_29"},{"key":"19_CR6","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":"19_CR7","doi-asserted-by":"crossref","unstructured":"S. Jain and E. Kinber. On intrinsic complexity of learning geometrical concepts from texts. In Proceedings of the Fourteenth Annual Conference on Computational Learning Theory,2001. To appear.","DOI":"10.1007\/3-540-44581-1_12"},{"key":"19_CR8","unstructured":"S. Jain, E. Kinber,and R. Wiehagen. Language learning from texts: Degrees of intrinsic complexity and their characterizations. In Nicolo Cesa-Bianchi and Sally Goldman,editors, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory,pages 47\u201358. Morgan Kaufmann,2000."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1006\/jcss.1996.0030","volume":"52","author":"S. Jain","year":"1996","unstructured":"S. Jain and A. Sharma. The intrinsic complexity of language identification. Journal of Computer and System Sciences,52:393\u2013402,1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"E. Kinber, C. Papazian, C. Smith,and R. Wiehagen. On the intrinsic complexity of learning recursive functions. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory,pages 257\u2013266. ACM Press,1999.","DOI":"10.1145\/307400.307465"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"T. Motoki, T. Shinohara,and K. Wright. The correct definition of finite elasticity: Corrigendum to identification of unions. In L. Valiant and M. Warmuth,editors, Proceedings of the Fourth Annual Workshop on Computational Learning Theory,page 375. Morgan Kaufmann,1991.","DOI":"10.1016\/B978-1-55860-213-7.50037-7"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"D. Osherson, M. Stob,and S. Weinstein. Systems that Learn:An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press,1986.","DOI":"10.7551\/mitpress\/6609.001.0001"},{"key":"19_CR13","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill,1967. Reprinted by MIT Press in 1987."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(99)00270-4","volume":"241","author":"T. Shinohara","year":"2000","unstructured":"T. Shinohara and H. Arimura. Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science A, 241:191\u2013209,2000. Special Issue for ALT\u201996.","journal-title":"Theoretical Computer Science A"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"K. Wright. Identification of unions of languages drawn from an identifiable class. In R. Rivest, D. Haussler,and M. Warmuth,editors, Proceedings of the Second Annual Workshop on Computational Learning Theory,pages 328\u2013333. Morgan Kaufmann,1989.","DOI":"10.1016\/B978-0-08-094829-4.50026-X"}],"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-45583-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:18:49Z","timestamp":1585603129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}