{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:02:21Z","timestamp":1725566541308},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234104"},{"type":"electronic","value":"9783540301950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30195-0_13","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T15:53:52Z","timestamp":1285170832000},"page":"139-150","source":"Crossref","is-referenced-by-count":1,"title":["Representing Languages by Learnable Rewriting Systems"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"Eyraud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"de la Higuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Christophe","family":"Janodet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R. Book","year":"1993","unstructured":"Book, R., Otto, F.: String-Rewriting Systems. Springer, Heidelberg (1993)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera de la","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning Journal\u00a027, 125\u2013138 (1997)","journal-title":"Machine Learning Journal"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Formal Methods and Semantics, North Holland, Amsterdam, vol.\u00a0B,ch.6, pp. 243\u2013320 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-58473-0_152","volume-title":"Grammatical Inference and Applications","author":"P. Dupont","year":"1994","unstructured":"Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol.\u00a0862, pp. 236\u2013245. Springer, Heidelberg (1994)"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(94)00074-3","volume":"51","author":"M. Frazier","year":"1994","unstructured":"Frazier, M., Page Jr., C.D.: Prefix grammars: An alternative characterisation of the regular languages. Information Processing Letters\u00a051(2), 67\u201371 (1994)","journal-title":"Information Processing Letters"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037, 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"13_CR7","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 1\u2013112. Oxford University Press, Oxford (1992)"},{"issue":"3","key":"13_CR8","first-page":"469","volume":"14","author":"T. Koshiba","year":"2000","unstructured":"Koshiba, T., M\u00e4kinen, E., Takada, Y.: Inferring pure context-free languages from positive data. Acta Cybernetica\u00a014(3), 469\u2013477 (2000)","journal-title":"Acta Cybernetica"},{"key":"13_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K. Lang","year":"1998","unstructured":"Lang, K., Pearlmutter, B.A., Price, R.A.: The Abbadingo one DFA learning competition. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"13_CR10","unstructured":"Lee, S.: Learning of context-free languages: A survey of the literature. Technical Report TR-12-96, Center for Research in Computing Technology, Harvard University, Cambridge, Massachusetts (1996)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association for Computing Machinery\u00a035(2), 324\u2013344 (1988)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45790-9_14","volume-title":"Grammatical Inference: Algorithms and Applications","author":"K. Nakamura","year":"2002","unstructured":"Nakamura, K., Matsumoto, M.: Incremental learning of context-free grammars. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 174\u2013184. Springer, Heidelberg (2002)"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Identifying hierarchical structure in sequences: a linear-time algorithm. Journal of Artificial Intelligence Research\u00a07, 67\u201382 (1997)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Nivat, M.: On some families of languages related to the dyck language. In: Proc. 2nd Annual Symposium on Theory of Computing (1970)","DOI":"10.1145\/800161.805168"},{"key":"13_CR15","series-title":"Series in Machine Perception and Artificial Intelligence","first-page":"99","volume-title":"Advances in Structural and Syntactic Pattern Recognition","author":"J. Oncina","year":"1992","unstructured":"Oncina, J., Garc\u00eda, P.: Identifying regular languages in polynomial time. In: Bunke, H. (ed.) Advances in Structural and Syntactic Pattern Recognition. Series in Machine Perception and Artificial Intelligence, vol.\u00a05, pp. 99\u2013108. World Scientific, Singapore (1992)"},{"key":"13_CR16","unstructured":"Petasis, G., Paliouras, G., Karkaletsis, V., Halatsis, C., Spyropoulos, C.: E-grids: Computationally efficient grammatical inference from positive examples (2004) (to appear, in Grammars)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0304-3975(97)00014-5","volume":"185","author":"Y. Sakakibara","year":"1997","unstructured":"Sakakibara, Y.: Recent advances of grammatical inference. Theoretical Computer Science\u00a0185, 15\u201345 (1997)","journal-title":"Theoretical Computer Science"},{"key":"13_CR18","unstructured":"Sakakibara, Y., Kondo, M.: Ga-based learning of context-free grammars using tabular representations. In: Proceedings of 16th International Conference on Machine Learning (ICML 1999), pp. 354\u2013360 (1999)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Starkie, B., Coste, F., van Zaanen, M.: Omphalos context-free language learning competition (2004), http:\/\/www.irisa.fr\/Omphalos","DOI":"10.1007\/978-3-540-30195-0_3"},{"issue":"298","key":"13_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(02)00423-1","volume":"1","author":"T. Yokomori","year":"2003","unstructured":"Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theor. Comput. Sci.\u00a01(298), 179\u2013206 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30195-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T20:50:48Z","timestamp":1559681448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30195-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234104","9783540301950"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30195-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}