{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:41Z","timestamp":1759637801037,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_21","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"266-279","source":"Crossref","is-referenced-by-count":14,"title":["Identification in the Limit of k,l-Substitutable Context-Free Languages"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Yoshinaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. Journal of the Association for Computing Machinery\u00a029(3), 741\u2013765 (1982)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR2","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D.: Negative results for equivalence queries. Machine Learning\u00a05, 121\u2013150 (1990)","journal-title":"Machine Learning"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0022-0000(85)90056-X","volume":"31","author":"L. Boasson","year":"1985","unstructured":"Boasson, L., S\u00e9nizergues, G.: NTS languages are deterministic and congruential. Journal of Computer and System Sciences\u00a031(3), 332\u2013342 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10994-006-9613-8","volume":"66","author":"J. Carme","year":"2007","unstructured":"Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducer. Machine Learning\u00a066(1), 33\u201367 (2007)","journal-title":"Machine Learning"},{"key":"21_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11872436_6","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Clark","year":"2006","unstructured":"Clark, A.: PAC-learning unambiguous NTS languages. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 59\u201371. Springer, Heidelberg (2006)"},{"key":"21_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11564089_23","volume-title":"Algorithmic Learning Theory","author":"A. Clark","year":"2005","unstructured":"Clark, A., Eyraud, R.: Identification in the limit of substitutable context-free languages. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol.\u00a03734, pp. 283\u2013296. Springer, Heidelberg (2005)"},{"key":"21_CR7","first-page":"1725","volume":"8","author":"A. Clark","year":"2007","unstructured":"Clark, A., Eyraud, R.: Polynomial identification in the limit of context-free substitutable languages. Journal of Machine Learning Research\u00a08, 1725\u20131745 (2007)","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"21_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0020-0190(92)90101-Z","volume":"44","author":"J. Engelfriet","year":"1992","unstructured":"Engelfriet, J.: An elementary proof of double Greibach normal form. Information Processing Letters\u00a044(6), 291\u2013293 (1992)","journal-title":"Information Processing Letters"},{"issue":"5","key":"21_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":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"1","key":"21_CR10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. Journal of the Association for Computing Machinery\u00a012(1), 42\u201352 (1965)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. de la Higuera","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013138 (1997)","journal-title":"Machine Learning"},{"issue":"9","key":"21_CR12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C. de la Higuera","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition\u00a038(9), 332\u20131348 (2005)","journal-title":"Pattern Recognition"},{"key":"21_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-45257-7_13","volume-title":"Grammatical Inference: Algorithms and Applications","author":"S. Kobayashi","year":"2000","unstructured":"Kobayashi, S.: Iterated transductions and efficient learning from positive data: A unifying view. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 157\u2013170. Springer, Heidelberg (2000)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-60454-5_47","volume-title":"Algorithmic Learning Theory","author":"S. Kobayashi","year":"1995","unstructured":"Kobayashi, S., Yokomori, T.: On approximately identifying concept classes in the limit. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS, vol.\u00a0997, pp. 298\u2013312. Springer, Heidelberg (1995)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-63577-7_35","volume-title":"Algorithmic Learning Theory","author":"S. Kobayashi","year":"1997","unstructured":"Kobayashi, S., Yokomori, T.: Identifiability of subspaces and homomorphic images of zero-reversible languages. In: Li, M., Maruoka, A. (eds.) ALT 1997. LNCS, vol.\u00a01316, pp. 48\u201361. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(96)00224-1","volume":"174","author":"S. Kobayashi","year":"1997","unstructured":"Kobayashi, S., Yokomori, T.: Learning approximately regular languages with reversible languages. Theoretical Computer Science\u00a0174(1-2), 251\u2013257 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.tcs.2008.02.030","volume":"397","author":"S. Lange","year":"2008","unstructured":"Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: A survey. Theoretical Computer Science\u00a0397(1-3), 194\u2013232 (2008)","journal-title":"Theoretical Computer Science"},{"key":"21_CR18","unstructured":"Lee, L.: Learning of context-free languages: A survey of the literature. Technical Report TR-12-96, Harvard University (1996), \n                      ftp:\/\/deas-ftp.harvard.edu\/techreports\/tr-12-96.ps.gz"},{"issue":"3","key":"21_CR19","first-page":"479","volume":"14","author":"E. M\u00e4kinen","year":"2000","unstructured":"M\u00e4kinen, E.: On inferring zero-reversible languages. Acta Cybernetica\u00a014(3), 479\u2013484 (2000)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"D.J. Rosenkrantz","year":"1967","unstructured":"Rosenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. Journal of ACM\u00a014(3), 501\u2013507 (1967)","journal-title":"Journal of ACM"},{"key":"21_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11872436_34","volume-title":"Grammatical Inference: Algorithms and Applications","author":"J.M. Sempere","year":"2006","unstructured":"Sempere, J.M.: Learning reversible languages with terminal distinguishability. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 354\u2013355. Springer, Heidelberg (2006)"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-0000(85)90055-8","volume":"31","author":"G. S\u00e9nizergues","year":"1985","unstructured":"S\u00e9nizergues, G.: The equivalence and inclusion problems for NTS languages. Journal of Computer and System Sciences\u00a031(3), 303\u2013331 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-75225-7_23","volume-title":"Algorithmic Learning Theory","author":"C. T\u00eernauca","year":"2007","unstructured":"T\u00eernauca, C., Knuutila, T.: Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.\u00a04754, pp. 272\u2013284. Springer, Heidelberg (2007)"},{"issue":"10","key":"21_CR24","first-page":"1224","volume":"E76-D","author":"M. Wakatsuki","year":"1993","unstructured":"Wakatsuki, M., Tomita, E.: A fast algorithm for checking the inclusion for very simple deterministic pushdown automata. IEICE transactions on information and systems\u00a0E76-D(10), 1224\u20131233 (1993)","journal-title":"IEICE transactions on information and systems"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(02)00423-1","volume":"298","author":"T. Yokomori","year":"2003","unstructured":"Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science\u00a0298, 179\u2013206 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(02)00423-1","volume":"298","author":"T. Yokomori","year":"2003","unstructured":"Yokomori, T.: Erratum to Polynomial-time identification of very simple grammars from positive data. Theoret. Comput. Sci.\u00a0298, 179\u2013206 (2003); Theoretical Computer Science 377(1-3), 282\u2013283 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:48:18Z","timestamp":1715312898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}