{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:27:44Z","timestamp":1762100864313,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_10","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"125-138","source":"Crossref","is-referenced-by-count":10,"title":["On Learning Regular Expressions and Patterns Via Membership and Correction Queries"],"prefix":"10.1007","author":[{"given":"Efim","family":"Kinber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"130","volume-title":"11th Annual ACM Symposium on Theory of Computing","author":"D. Angluin","year":"1979","unstructured":"Angluin, D.: Finding Patterns Common to a Set of Strings (extended abstract). In: 11th Annual ACM Symposium on Theory of Computing, pp. 130\u2013141. ACM Press, New York (1979)"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","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 ACM\u00a029(3), 741\u2013765 (1982)","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"10_CR4","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and Concept Learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"10_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11872436_23","volume-title":"Grammatical Inference: Algorithms and Applications","author":"L. Becerra-Bonache","year":"2006","unstructured":"Becerra-Bonache, L., Dediu, A.H., T\u00eern\u0103uc\u0103, C.: Learning DFA from Correction and Equivalence Queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 281\u2013292. Springer, Heidelberg (2006)"},{"key":"10_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-74958-5_6","volume-title":"Machine Learning: ECML 2007","author":"L. Becerra-Bonache","year":"2007","unstructured":"Becerra-Bonache, L., de la Higuera, C., Janodet, J.C., Tantini, F.: Learning Balls of Strings with Correction Queries. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol.\u00a04701, pp. 18\u201329. Springer, Heidelberg (2007)"},{"key":"10_CR7","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of Concise DTDs from XML Data. In: 32nd International Conference on Very Large Data Bases VLDB (2006)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Gelade, W., Neven, F., Vansummeren, S.: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. In: WWW Conference 2008, Beijing, China, pp. 825\u2013836 (2008)","DOI":"10.1145\/1367497.1367609"},{"key":"10_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, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"10_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11564089_24","volume-title":"Algorithmic Learning Theory","author":"H. Fernau","year":"2005","unstructured":"Fernau, H.: Algorithms for Learning Regular Expressions. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol.\u00a03734, pp. 297\u2013311. Springer, Heidelberg (2005)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-56004-1_16","volume-title":"Analogical and Inductive Inference","author":"E. Kinber","year":"1992","unstructured":"Kinber, E.: Learning a Class of Regular Expressions via Restricted Subset Queries. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol.\u00a0642, pp. 232\u2013243. Springer, Heidelberg (1992)"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., Wiehagen, R.: Polynomial-time Inference of Arbitrary Pattern Languages. New Generation Computing\u00a08(4), 361\u2013370 (1991)","journal-title":"New Generation Computing"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0010-0277(99)00031-1","volume":"72","author":"D.L.T. Rohde","year":"1999","unstructured":"Rohde, D.L.T., Plaut, D.C.: Language Acquisition in the Absence of Explicit Negative Evidence: How Important Is Starting Small? Cognition\u00a072, 67\u2013109 (1999)","journal-title":"Cognition"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Sakakibara, Y.: Learning Context-free Grammars from Structural Data in Polynomial Time. Theoretical Computer Science\u00a076, 223\u2013242 (1990)","journal-title":"Theoretical Computer Science"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-60217-8_13","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"T. Shinohara","year":"1995","unstructured":"Shinohara, T., Arikawa, S.: Pattern Inference. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS, vol.\u00a0961, pp. 259\u2013291. Springer, Heidelberg (1995)"},{"key":"10_CR16","series-title":"Lecture Notes in Artificial Intelligence","first-page":"264","volume-title":"Algorithmic Learning Theory","author":"C. T\u00eern\u0103uc\u0103","year":"2007","unstructured":"T\u00eern\u0103uc\u0103, 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. 264\u2013276. Springer, Heidelberg (2007)"},{"key":"10_CR17","unstructured":"T\u00eern\u0103uc\u0103, C.I., T\u00eern\u0103uc\u0103, C.: Learning Regular Tree Languages from Correction and Equivalence Queries. Journal of Automata, Languages and Combinatorics 12 (2007)"},{"issue":"11","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A Theory of the Learnable. Communications of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1093\/oso\/9780198538509.003.0007","volume":"13","author":"T. Yokomori","year":"1994","unstructured":"Yokomori, T.: Learning Non-deterministic Finite Automata from Queries and Counterexamples. Machine Intelligence\u00a013, 169\u2013189 (1994)","journal-title":"Machine Intelligence"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:48:07Z","timestamp":1715312887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}