{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:27Z","timestamp":1725577407309},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_29","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"272-281","source":"Crossref","is-referenced-by-count":0,"title":["Types of Trusted Information That Make DFA Identification with Correction Queries Feasible"],"prefix":"10.1007","author":[{"given":"Cristina","family":"T\u00eern\u0103uc\u0103","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u0103t\u0103lin Ionu\u0163","family":"T\u00eern\u0103uc\u0103","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D. Angluin","year":"1978","unstructured":"Angluin, D.: On the complexity of minimum inference of regular sets. Information and Control\u00a039(3), 337\u2013350 (1978)","journal-title":"Information and Control"},{"issue":"1","key":"29_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"},{"key":"29_CR3","unstructured":"Angluin, D.: Learning k-bounded context-free grammars. Technical Report TR-557, Yale University, New Haven, Conn. (1987)"},{"key":"29_CR4","unstructured":"Angluin, D.: Learning k-term DNF formulas using queries and counter-examples. Technical Report TR-559, Yale University, New Haven, Conn. (1987)"},{"issue":"2","key":"29_CR5","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":"29_CR6","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":"29_CR7","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":"29_CR8","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)"},{"issue":"5","key":"29_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"},{"issue":"3","key":"29_CR10","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(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jcss.1996.0020","volume":"52","author":"S.A. Goldman","year":"1996","unstructured":"Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. Journal of Computer and System Sciences\u00a052(2), 255\u2013267 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR12","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 (1979)"},{"key":"29_CR13","unstructured":"T\u00eern\u0103uc\u0103, C.: Language Learning with Correction Queries. Ph.D. thesis, Universitat Rovira i Virgili, Tarragona, Spain (2009)"},{"key":"29_CR14","unstructured":"T\u00eern\u0103uc\u0103, C., Knuutila, T.: Efficient language learning with correction queries. Technical Report 822, Turku Center for Computer Science (2007)"},{"key":"29_CR15","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":"29_CR16","series-title":"Word, Language, Grammar","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol.\u00a01, ch. 2, pp. 41\u2013110. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T02:30:38Z","timestamp":1553394638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}