{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:32Z","timestamp":1725484412955},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45790-9_6","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T22:46:02Z","timestamp":1179269162000},"page":"63-76","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Some Classes of Regular Languages Identifiable in the Limit from Positive Data"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[]},{"given":"Alain","family":"Terlutte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"crossref","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. Inform. Control, 45(2):117\u2013135, May 1980.","journal-title":"Inform. Control"},{"doi-asserted-by":"crossref","unstructured":"D. Angluin. Inference of reversible languages. J. ACM, 1982.","key":"6_CR2","DOI":"10.1145\/322326.322334"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"M. Blum","year":"1975","unstructured":"M. Blum and L. Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministic finite automata. In ICGI\u20192000, 5th International Colloquium on Grammatical Inference, volume 1891 of LNAI, pages 39\u201350. Springer Verlag, 2000.","key":"6_CR4","DOI":"10.1007\/978-3-540-45257-7_4"},{"doi-asserted-by":"crossref","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using RFSA. In Springer-Verlag, editor, Proceedings of the 12th International Conference on Algorithmic Learning Theory (ALT-01), 2001.","key":"6_CR5","DOI":"10.1007\/3-540-45583-3_26"},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44693-1_13","volume-title":"STACS 2001","author":"F. Denis","year":"2001","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. In STACS 2001, volume 2010 of LNCS, pages p. 144\u2013157. Springer Verlag, 2001."},{"doi-asserted-by":"crossref","unstructured":"H. Fernau. Learning of terminal distinguishable languages. In Proc. AMAI 2000, 2000.","key":"6_CR7","DOI":"10.1007\/3-540-40992-0_9"},{"doi-asserted-by":"crossref","unstructured":"Henning Fernau. Identification of function distinguishable languages. In 11th International Conference on Algorithmic Learning Theory, ALT 2000, volume 1968 of LNAI, pages 116\u2013130. Springer, 2000.","key":"6_CR8","DOI":"10.1007\/3-540-40992-0_9"},{"key":"6_CR9","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. Inform. Control, 10:447\u2013474, 1967.","journal-title":"Inform. Control"},{"doi-asserted-by":"crossref","unstructured":"T. Head, S. Kobayashi, and T. Yokomori. Locality, reversibility and beyond: Learning languages from positive data. In ALT 98, 9th International Conference on Algorithmic Learning Theory, volume 1501 of LNAI, pages 191\u2013204. Springer-Verlag, 1998.","key":"6_CR10","DOI":"10.1007\/3-540-49730-7_15"},{"unstructured":"M. Kanazawa. Learnable Classes of Categorial Grammars. The European Association for Logic, Language and Information. CLSI Publications, 1998.","key":"6_CR11"},{"unstructured":"S. Kapur. Computational Learning of Languages. PhD thesis, Cornell University, 1991.","key":"6_CR12"},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/3-540-58520-6_80","volume-title":"Learning concatenations of locally testable languages from positive data","author":"S. Kobayashi","year":"1994","unstructured":"S. Kobayashi and T. Yokomori. Learning concatenations of locally testable languages from positive data. LNCS, 872:407\u2013422, 1994."},{"doi-asserted-by":"crossref","unstructured":"Satoshi Kobayashi and Takashi Yokomori. Learning approximately regular languages with reversible languages. Theoretical Computer Science, 174(1\u20132):251\u2013257, 15 March 1997. Note.","key":"6_CR14","DOI":"10.1016\/S0304-3975(96)00224-1"},{"doi-asserted-by":"crossref","unstructured":"Yasubumi Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 1992.","key":"6_CR15","DOI":"10.1016\/0890-5401(92)90003-X"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume":"1","author":"S. Yu","year":"1997","unstructured":"Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41\u2013110. Springer Verlag, 1997.","journal-title":"Handbook of Formal Languages, Regular Languages"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:22:34Z","timestamp":1558257754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"5 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}