{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:50:20Z","timestamp":1761947420757},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45790-9_14","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T22:46:02Z","timestamp":1179269162000},"page":"174-184","source":"Crossref","is-referenced-by-count":11,"title":["Incremental Learning of Context Free Grammars"],"prefix":"10.1007","author":[{"given":"Katsuhiko","family":"Nakamura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masashi","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"14_CR1","unstructured":"J. E. Hopcroft, and J. E. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley (1979)."},{"key":"14_CR2","unstructured":"P. Langley and S. Stromsten, Learning Context-Free Grammars with a Simplicity Bias, Machine Learning: ECML 2000, LNAI1810, Springer-Verlag, 220\u2013228(2000)."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"K. Nakamura, and Y. Ishiwata, Synthesizing context free grammars from sample strings based on inductive CYK algorithm, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 186\u2013195 (2000).","DOI":"10.1007\/978-3-540-45257-7_15"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"R. Parekh, and V. Honavor, An incremental interactive algorithm for regular grammar inference, Third International Colloquium on Grammatical Inference (ICGI-96), 222\u2013237 (1996).","DOI":"10.1007\/BFb0033358"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0304-3975(97)00014-5","volume":"185","author":"Y. Sakakibara","year":"1997","unstructured":"Y. Sakakibara, Recent advances of grammatical inference, Theoretical Computer Science, 185, 15\u201345(1997).","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","unstructured":"Y. Sakakibara, and M. Kondo, GA-based learning of context-free grammars using tabular representations, Proc. 16th International Conference of Machine Learning, 354\u2013360 (1999)."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Y. Sakakibara, and H. Muramatsu, Learning of context-free grammars partially structured examples, Fifth International Colloquium on Grammatical Inference (ICGI 2000), LNAI 1891, Springer-Verlag, 229\u2013240 (2000).","DOI":"10.1007\/978-3-540-45257-7_19"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:55:13Z","timestamp":1556398513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}