{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:54:01Z","timestamp":1781855641555,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209182","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Regular Transducer Expressions for Regular Transformations"],"prefix":"10.1145","author":[{"given":"Vrunda","family":"Dave","sequence":"first","affiliation":[{"name":"IIT Bombay"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Gastin","sequence":"additional","affiliation":[{"name":"LSV, ENS Paris-Saclay, CNRS, UMI RELAX"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shankara Narayanan","family":"Krishna","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"FSTTCS","author":"Alur Rajeev","year":"2010","unstructured":"Rajeev Alur and Pavol Cern\u00fd. 2010. Expressiveness of streaming string transducers. In FSTTCS 2010. 1--12."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092842"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676981"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.18"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603151"},{"key":"e_1_3_2_1_6_1","volume-title":"ICALP","author":"Boja\u0144czyk Miko\u0142aj","year":"2017","unstructured":"Miko\u0142aj Boja\u0144czyk, Laure Daviaud, Bruno Guillon, and Vincent Penelle. 2017. Which Classes of Origin Graphs Are Generated by Transducers. In ICALP 2017. 114:1--114:13."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13182-0_9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00618-7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.10.013"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/278918.278932"},{"key":"e_1_3_2_1_11_1","volume-title":"Regular Transducer Expressions for Regular Transformations. CoRR abs\/1802.02094","author":"Dave Vrunda","year":"2018","unstructured":"Vrunda Dave, Paul Gastin, and Krishna Shankara Narayanan. 2018. Regular Transducer Expressions for Regular Transformations. CoRR abs\/1802.02094 (2018). http:\/\/arxiv.org\/abs\/1802.02094"},{"key":"e_1_3_2_1_12_1","volume-title":"FO-Definable Transformations of Infinite Strings. In FSTTCS","author":"Dave Vrunda","year":"2016","unstructured":"Vrunda Dave, Shankara Narayanan Krishna, and Ashutosh Trivedi. 2016. FO-Definable Transformations of Infinite Strings. In FSTTCS 2016. 12:1--12:14."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1667106"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371512"},{"key":"e_1_3_2_1_15_1","volume-title":"First-order Definable String Transformations. In FSTTCS","author":"Filiot Emmanuel","year":"2014","unstructured":"Emmanuel Filiot, Shankara Narayanan Krishna, and Ashutosh Trivedi. 2014. First-order Definable String Transformations. In FSTTCS 2014. 147--159."},{"key":"e_1_3_2_1_16_1","unstructured":"Paul Gastin and Shankara Narayanan Krishna. 2018. Unambiguous forest factorization. (2018). Unpublished."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80006-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90047-L"},{"key":"e_1_3_2_1_19_1","volume-title":"Backward Deterministic B\u00fcchi Automata on Infinite Words. In FSTTCS","author":"Wilke Thomas","year":"2017","unstructured":"Thomas Wilke. 2017. Backward Deterministic B\u00fcchi Automata on Infinite Words. In FSTTCS 2017. 6:6--6:9."}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:34:27Z","timestamp":1781854467000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":19,"alternative-id":["10.1145\/3209108.3209182","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209182","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}