{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:25:23Z","timestamp":1762100723547,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752240"},{"type":"electronic","value":"9783540752257"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75225-7_23","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T12:46:43Z","timestamp":1192020403000},"page":"272-284","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries"],"prefix":"10.1007","author":[{"given":"Cristina","family":"T\u00eern\u0103uc\u0103","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Knuutila","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","first-page":"130","volume-title":"STOC 1979","author":"D. Angluin","year":"1979","unstructured":"Angluin, D.: Finding patterns common to a set of strings (extended abstract). In: STOC 1979. Proc. 11 th Annual ACM Symposium on Theory of Computing, pp. 130\u2013141. ACM Press, New York, NY, USA (1979)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control\u00a051(1), 76\u201387 (1981)","journal-title":"Information and Control"},{"issue":"3","key":"23_CR3","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":"23_CR4","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"},{"issue":"4","key":"23_CR5","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02(4), 319\u2013342 (1988)","journal-title":"Machine Learning"},{"issue":"2","key":"23_CR6","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D.: Negative results for equivalence queries. Machine Learning\u00a05(2), 121\u2013150 (1990)","journal-title":"Machine Learning"},{"key":"23_CR7","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. Beccera-Bonache","year":"2006","unstructured":"Beccera-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)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00224-005-1233-3","volume":"40","author":"F. Drewes","year":"2007","unstructured":"Drewes, F., H\u00f6gberg, J.: Query learning of regular tree languages: How to avoid dead states. Theory of Computing Systems\u00a040(2), 163\u2013185 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"5","key":"23_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"},{"key":"23_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachusetts (1979)"},{"key":"23_CR11","first-page":"57","volume-title":"COLT 1989","author":"M. Kearns","year":"1989","unstructured":"Kearns, M., Pitt, L.: A polynomial-time algorithm for learning k-variable pattern languages from examples. In: COLT 1989. Proc. 2nd Annual Workshop on Computational Learning Theory, pp. 57\u201371. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1989)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Mart\u00edn-Vide, C., Mitrana, V., P\u0103un, G. (eds.): Formal Languages and Applications. Studies in Fuzzyness and Soft Computing, vol. 148, Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-39886-8"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0890-5401(87)90026-5","volume":"74","author":"A. Marron","year":"1987","unstructured":"Marron, A., Ko, K.I.: Identification of pattern languages from examples and queries. Information and Computation\u00a074(2), 91\u2013112 (1987)","journal-title":"Information and Computation"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-56004-1_18","volume-title":"Analogical and Inductive Inference","author":"Y. Mukouchi","year":"1992","unstructured":"Mukouchi, Y.: Characterization of finite identification. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol.\u00a0642, pp. 260\u2013267. Springer, Heidelberg (1992)"},{"key":"23_CR15","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":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-540-72504-6_36","volume-title":"TAMC 2007","author":"C. T\u00eern\u0103uc\u0103","year":"2007","unstructured":"T\u00eern\u0103uc\u0103, C., Kobayashi, S.: A characterization of the language classes learnable with correction queries. In: TAMC 2007. LNCS, vol.\u00a04484, pp. 398\u2013407. Springer, Heidelberg (2007)"},{"key":"23_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, Special Issue WATA, 2006 (to appear, 2007)"},{"issue":"11","key":"23_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":"23_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"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01201279","volume":"29","author":"T. Yokomori","year":"1996","unstructured":"Yokomori, T.: Learning two-tape automata from queries and counterexamples. Mathematical Systems Theory\u00a029(3), 259\u2013270 (1996)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75225-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T12:24:24Z","timestamp":1708259064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75225-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752240","9783540752257"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75225-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}