{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:21:33Z","timestamp":1725909693928},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670881"},{"type":"electronic","value":"9783319670898"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67089-8_6","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T08:47:26Z","timestamp":1503564446000},"page":"75-86","source":"Crossref","is-referenced-by-count":2,"title":["Copyful Streaming String Transducers"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alur, A., \u010cern\u00fd, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: POPL, pp. 599\u2013610 (2011)","key":"6_CR1","DOI":"10.1145\/1926385.1926454"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P.: Expressiveness of streaming string transducers. In: FSTTCS, vol. 8, pp. 1\u201312 (2010)","key":"6_CR2","DOI":"10.1007\/978-3-642-22012-8_1"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. CoRR, abs\/1104.2599 (2011)","key":"6_CR3","DOI":"10.1007\/978-3-642-20920-8_1"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-31585-5_8","volume-title":"Automata, Languages, and Programming","author":"R Alur","year":"2012","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 42\u201353. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31585-5_8"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, pp. 13\u201322. IEEE Computer Society (2013)","key":"6_CR5","DOI":"10.1109\/LICS.2013.65"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22012-8_1","volume-title":"Automata, Languages and Programming","author":"R Alur","year":"2011","unstructured":"Alur, R., Deshmukh, J.V.: Nondeterministic streaming string transducers. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 1\u201320. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22012-8_1"},{"doi-asserted-by":"crossref","unstructured":"Alur, R., Filiot, E., Trivedi, A.: Regular transformations of infinite strings. In: LICS, pp. 65\u201374. IEEE (2012)","key":"6_CR7","DOI":"10.1109\/LICS.2012.18"},{"doi-asserted-by":"crossref","unstructured":"Benedikt, M., Duff, T., Sharad, A., Worrell, J.: Polynomial automata: zeroness and applications. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017. ACM (2017, to appear)","key":"6_CR8","DOI":"10.1109\/LICS.2017.8005101"},{"issue":"3","key":"6_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(86)90134-9","volume":"47","author":"K Culik","year":"1986","unstructured":"Culik, K., Karhum\u00e4ki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theor. Comput. Sci. 47(3), 71\u201384 (1986)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Dartois, L., Filiot, E., Reynier, P.-A., Talbot, J.-M.: Two-way visibly pushdown automata and transducers. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, pp. 217\u2013226. ACM (2016)","key":"6_CR10","DOI":"10.1145\/2933575.2935315"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-53132-7_11","volume-title":"Developments in Language Theory","author":"L Dartois","year":"2016","unstructured":"Dartois, L., Jecker, I., Reynier, P.-A.: Aperiodic string transducers. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 125\u2013137. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53132-7_11"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Logic 2, 216\u2013254 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1","key":"6_CR13","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1006\/inco.1999.2807","volume":"154","author":"J Engelfriet","year":"1999","unstructured":"Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inf. Comput. 154(1), 34\u201391 (1999)","journal-title":"Inf. Comput."},{"issue":"5","key":"6_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ipl.2006.05.015","volume":"100","author":"J Engelfriet","year":"2006","unstructured":"Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5), 206\u2013212 (2006)","journal-title":"Inf. Process. Lett."},{"unstructured":"Filiot, E., Krishna, S.N., Trivedi, A.: First-order definable string transformations. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. LIPIcs, vol. 29, pp. 147\u2013159. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)","key":"6_CR15"},{"issue":"3","key":"6_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2984450.2984453","volume":"3","author":"E Filiot","year":"2016","unstructured":"Filiot, E., Reynier, P.-A.: Transducers, logic and algebra for functions of finite words. SIGLOG News 3(3), 4\u201319 (2016)","journal-title":"SIGLOG News"},{"issue":"3","key":"6_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"TV Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free nondeterministic generalized machines. J. ACM 15(3), 409\u2013413 (1968)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"6_CR18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0304-3975(00)00158-4","volume":"244","author":"J Honkala","year":"2000","unstructured":"Honkala, J.: A short solution for the HDT0L sequence equivalence problem. Theor. Comput. Sci. 244(1\u20132), 267\u2013270 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR19","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","volume":"18","author":"A Lindenmayer","year":"1968","unstructured":"Lindenmayer, A.: Mathematical models for cellular interaction in development. J. Theoret. Biol. 18, 280\u2013315 (1968)","journal-title":"J. Theoret. Biol."},{"issue":"2","key":"6_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(77)90001-9","volume":"5","author":"A Mandel","year":"1977","unstructured":"Mandel, A., Simon, I.: On finite semigroups of matrices. Theor. Comput. Sci. 5(2), 101\u2013111 (1977)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Seidl, H., Maneth, S., Kemper, G.: Equivalence of deterministic top-down tree-to-string transducers is decidable. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, pp. 943\u2013962. IEEE Computer Society (2015)","key":"6_CR21","DOI":"10.1109\/FOCS.2015.62"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T01:21:00Z","timestamp":1602811260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}