{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:00Z","timestamp":1759638240814,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_3","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"29-42","source":"Crossref","is-referenced-by-count":19,"title":["A Polynomial Algorithm for the Inference of Context Free Languages"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Clark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Eyraud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-45435-7_13","volume-title":"Computational Learning Theory","author":"C.D.L. Higuera","year":"2002","unstructured":"Higuera, C.D.L., Oncina, J.: Inferring deterministic linear languages. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 185\u2013200. Springer, Heidelberg (2002)"},{"issue":"1","key":"3_CR2","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(1), 179\u2013206 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR3","first-page":"1725","volume":"8","author":"A. Clark","year":"2007","unstructured":"Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research\u00a08, 1725\u20131745 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"3_CR4","volume-title":"Algebraic Linguistics; Analytical Models","author":"S. Marcus","year":"1967","unstructured":"Marcus, S.: Algebraic Linguistics; Analytical Models. Academic Press, N. Y (1967)"},{"key":"3_CR5","volume-title":"Generalised Phrase Structure Grammar","author":"G. Gazdar","year":"1985","unstructured":"Gazdar, G., Klein, E., Pullum, G., Sag, I.: Generalised Phrase Structure Grammar. Basil Blackwell, Malden (1985)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1009907814595","volume":"3","author":"P. Boullier","year":"2000","unstructured":"Boullier, P.: A Cubic Time Extension of Context-Free Grammars. Grammars\u00a03, 111\u2013131 (2000)","journal-title":"Grammars"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.11.010","volume":"354","author":"P. Asveld","year":"2006","unstructured":"Asveld, P.: Generating all permutations by context-free grammars in Chomsky normal form. Theoretical Computer Science\u00a0354(1), 118\u2013130 (2006)","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","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, 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"4","key":"3_CR9","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn.\u00a02(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"3_CR10","series-title":"Lecture Notes in Artificial Intelligence","first-page":"8","volume-title":"Inductive inference, dfa\u2019s, and computational complexity","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, dfa\u2019s, and computational complexity. LNCS (LNAI), pp. 8\u201314. Springer, Heidelberg (1989)"},{"issue":"2","key":"3_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(2), 125\u2013138 (1997)","journal-title":"Machine Learning"},{"key":"3_CR12","unstructured":"Adriaans, P.: Learning shallow context-free languages under simple distributions. Algebras, Diagrams and Decisions in Language, Logic and Computation 127 (2002)"},{"key":"3_CR13","unstructured":"Horning, J.J.: A Study of Grammatical Inference. PhD thesis, Stanford University, Computer Science Department, California (1969)"},{"key":"3_CR14","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":"3_CR15","doi-asserted-by":"crossref","unstructured":"Klein, D., Manning, C.: Corpus-based induction of syntactic structure: models of dependency and constituency. In: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, pp. 478\u2013485 (2004)","DOI":"10.3115\/1218955.1219016"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:48:38Z","timestamp":1715312918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}