{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:16:54Z","timestamp":1725466614970},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_25","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"273-283","source":"Crossref","is-referenced-by-count":1,"title":["Learning Rational Functions"],"prefix":"10.1007","author":[{"given":"Adrien","family":"Boiret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"25_CR2","unstructured":"Berstel, J., Boasson, L., Carton, O., Fagnot, I.: Minimization of automata. Computing Research Repository, abs\/1010.5318 (2010)"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10994-006-9613-8","volume":"66","author":"J. Carme","year":"2007","unstructured":"Carme, J., Gilleron, R., Lemay, A., Niehren, J.: Interactive learning of node selecting tree transducers. Machine Learning\u00a066(1), 33\u201367 (2007)","journal-title":"Machine Learning"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-09510-1_8","volume-title":"Automata, Languages, and Programming","author":"C. Choffrut","year":"1979","unstructured":"Choffrut, C.: A Generalization of Ginsburg and Rose\u2019s Characterisation of g-s-m Mappings. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 88\u2013103. Springer, Heidelberg (1979)"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(01)00219-5","volume":"292","author":"C. Choffrut","year":"2003","unstructured":"Choffrut, C.: Minimizing subsequential transducers: a survey. TCS\u00a0292(1), 131\u2013143 (2003)","journal-title":"TCS"},{"key":"25_CR6","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)"},{"key":"25_CR7","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\u00a027, 125\u2013137 (1997)","journal-title":"Machine Learning"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1147\/JRD.1965.5392157","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, G.: On relations defined by generalized finite automata. IBM Journ. of Research and Development\u00a09, 88\u2013101 (1965)","journal-title":"IBM Journ. of Research and Development"},{"key":"25_CR9","first-page":"198","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory\u00a010, 198\u2013231 (1977)","journal-title":"Math. Syst. Theory"},{"issue":"5","key":"25_CR10","first-page":"271","volume":"75","author":"J. Engelfriet","year":"2009","unstructured":"Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. JCSS\u00a075(5), 271\u2013286 (2009)","journal-title":"JCSS"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-14455-4_18","volume-title":"Developments in Language Theory","author":"S. Friese","year":"2010","unstructured":"Friese, S., Seidl, H., Maneth, S.: Minimization of Deterministic Bottom-Up Tree Transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 185\u2013196. Springer, Heidelberg (2010)"},{"key":"25_CR12","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. Infor. and Cont.\u00a037, 302\u2013320 (1978)","journal-title":"Infor. and Cont."},{"issue":"37","key":"25_CR13","doi-asserted-by":"publisher","first-page":"3539","DOI":"10.1016\/j.tcs.2009.03.022","volume":"410","author":"J. H\u00f6gberg","year":"2009","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. TCS\u00a0410(37), 3539\u20133552 (2009)","journal-title":"TCS"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: TMC, pp. 189\u2013196 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for Top-Down XML transf. In: PODS, pp. 285\u2013296 (2010)","DOI":"10.1145\/1807085.1807122"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: Patt. Recog. and Image Anal., pp. 49\u201361 (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"25_CR17","unstructured":"Oncina, J., Garc\u00eda, P.: Inference of recognizable tree sets. Tech. report, Univ. de Alicante (1993)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/34.211465","volume":"15","author":"J. Oncina","year":"1993","unstructured":"Oncina, J., Garcia, P., Vidal, E.: Learning subsequential transducers for pattern recognition and interpretation tasks. Patt. Anal. & Mach. Intell.\u00a015, 448\u2013458 (1993)","journal-title":"Patt. Anal. & Mach. Intell."},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0033365","volume-title":"Grammatical Inference: Learning Syntax from Sentences","author":"J. Oncina","year":"1996","unstructured":"Oncina, J., Varo, M.A.: Using Domain Information during the Learning of a Subsequential Transducer. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol.\u00a01147, pp. 313\u2013325. Springer, Heidelberg (1996)"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/0220042","volume":"20","author":"C. Reutenauer","year":"1991","unstructured":"Reutenauer, C., Sch\u00fctzenberger, M.P.: Minimalization of rational word functions. SIAM Journal on Computing\u00a020, 669\u2013685 (1991)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:32Z","timestamp":1620128492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}