{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:46Z","timestamp":1725771466465},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_40","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"490-502","source":"Crossref","is-referenced-by-count":5,"title":["Learning Sequential Tree-to-Word Transducers"],"prefix":"10.1007","author":[{"given":"Gr\u00e9goire","family":"Laurence","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"}]},{"given":"S\u0142awek","family":"Staworko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","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. ACM Transactions on the Web\u00a04(4) (2010)","DOI":"10.1145\/1841909.1841911"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Vansummeren, S.: Inference of concise regular expressions and DTDs. ACM TODS\u00a035(2) (2010)","DOI":"10.1145\/1735886.1735890"},{"issue":"1","key":"40_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"},{"issue":"1","key":"40_CR4","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":"40_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (October 2007), Available online since 1997: \n                    \n                      http:\/\/tata.gforge.inria.fr"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C. Higuera de la","year":"2005","unstructured":"de la Higuera, C.: A bibliographical study of grammatical inference. Pattern Recognition\u00a038, 1332\u20131348 (2005)","journal-title":"Pattern Recognition"},{"issue":"5","key":"40_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.jcss.2009.01.001","volume":"75","author":"J. Engelfriet","year":"2009","unstructured":"Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. Journal of Computer and System Science\u00a075(5), 271\u2013286 (2009)","journal-title":"Journal of Computer and System Science"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-15155-2_32","volume-title":"Mathematical Foundations of Computer Science 2010","author":"E. Filiot","year":"2010","unstructured":"Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of visibly pushdown transducers. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 355\u2013367. Springer, Heidelberg (2010)"},{"key":"40_CR9","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":"40_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. Inform. Control\u00a037, 302\u2013320 (1978)","journal-title":"Inform. Control"},{"issue":"3","key":"40_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T.V. Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for Lambda-Free nondeterministic generalized machines. Journal of the ACM\u00a015(3), 409\u2013413 (1968)","journal-title":"Journal of the ACM"},{"key":"40_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-21254-3_28","volume-title":"Language and Automata Theory and Applications","author":"G. Laurence","year":"2011","unstructured":"Laurence, G., Lemay, A., Niehren, J., Staworko, S., Tommasi, M.: Normalization of sequential Top-Down Tree-to-Word transducers. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 354\u2013365. Springer, Heidelberg (2011)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for Top-Down XML transformations. In: 29th PODS 2010, pp. 285\u2013296. ACM Press (2010)","DOI":"10.1145\/1807085.1807122"},{"issue":"7","key":"40_CR14","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.ic.2008.01.002","volume":"206","author":"W. Martens","year":"2008","unstructured":"Martens, W., Neven, F., Gyssens, M.: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput.\u00a0206(7), 806\u2013827 (2008)","journal-title":"Inf. Comput."},{"key":"40_CR15","unstructured":"Oncina, J., Garc\u00eda, P.: Inference of recognizable tree sets. Tech. report, Dept de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Univ. de Alicante (1993), DSIC-II\/47\/93"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Oncina, J., Gracia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition, pp. 99\u2013108 (1992)","DOI":"10.1142\/9789812797919_0007"},{"key":"40_CR17","unstructured":"Papadimitriou, C.: Computational complexity. Addison-Wesley (1994)"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70583-3_32","volume-title":"Automata, Languages and Programming","author":"J.-F. Raskin","year":"2008","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 386\u2013397. Springer, Heidelberg (2008)"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-03409-1_28","volume-title":"Fundamentals of Computation Theory","author":"S. Staworko","year":"2009","unstructured":"Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of deterministic nested word to word transducers. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 310\u2013322. Springer, Heidelberg (2009)"},{"key":"40_CR20","unstructured":"Staworko, S., Wieczorek, P.: Learning XML twig queries. CoRR, abs\/1106.3 (2011)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T05:56:26Z","timestamp":1558850186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}