{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:54:11Z","timestamp":1781855651726,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":34,"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.3209181","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"295-304","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Logics for Word Transductions with Synthesis"],"prefix":"10.1145","author":[{"given":"Luc","family":"Dartois","sequence":"first","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Filiot","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Lhote","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Belgium, LaBRI, Universit\u00e9 de Bordeaux, France"}],"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":"Arithmetic and Automata. In Int. Congr. Math","author":"Church Alonzo","year":"1962","unstructured":"Alonzo Church. 1962. Logic, Arithmetic and Automata. In Int. Congr. Math. Stockholm, 23--35."},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Expressiveness of streaming string transducers","volume":"8","author":"Alur Rajeev","year":"2010","unstructured":"Rajeev Alur and Pavol \u010cern\u00fd. 2010. Expressiveness of streaming string transducers. In FSTTCS. LIPIcs., Vol. 8:1--12. Schloss Dagstuhl.","journal-title":"FSTTCS. LIPIcs."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027225"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603151"},{"key":"e_1_3_2_1_5_1","volume-title":"Transducers with Origin Information. In ICALP'14","author":"Boja\u0144czyk Miko\u0142aj","year":"2014","unstructured":"Miko\u0142aj Boja\u0144czyk. 2014. Transducers with Origin Information. In ICALP'14."},{"key":"e_1_3_2_1_6_1","volume-title":"ICALP 2017","author":"Bojanczyk Mikolaj","year":"2017","unstructured":"Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, and Vincent Penelle. 2017. Which Classes of Origin Graphs Are Generated by Transducers. In ICALP 2017, July 10-14, 2017, Warsaw, Poland. 114:1--114:13."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Mikolaj Bojanczyk Anca Muscholl Thomas Schwentick Luc Segoufin and Claire David. 2006. Two-Variable Logic on Words with Data. In LICS. 7--16. 10.1109\/LICS.2006.51","DOI":"10.1109\/LICS.2006.51"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 14th Congress of Logic, Methodology and Philosophy of Science Nancy","author":"Carayol Arnaud","year":"2014","unstructured":"Arnaud Carayol and Christof L\u00f6ding. 2014. Uniformization in Automata Theory. In Proceedings of the 14th Congress of Logic, Methodology and Philosophy of Science Nancy, July 19-26, 2011. London: College Publications, 153--178."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00083-6"},{"key":"e_1_3_2_1_11_1","volume-title":"On Reversible Transducers. In ICALP 2017","author":"Dartois Luc","year":"2017","unstructured":"Luc Dartois, Paulin Fournier, Isma\u00ebl Jecker, and Nathan Lhote. 2017. On Reversible Transducers. In ICALP 2017, July 10-14, 2017, Warsaw, Poland. 113:1--113:12."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Rodrigo de Souza. 2013. Uniformisation of Two-Way Transducers. In LATA.","DOI":"10.1007\/978-3-642-37064-9_48"},{"key":"e_1_3_2_1_13_1","volume-title":"Logic and Automata: History and Perspectives (Texts in Logic and Games)","author":"Diekert Volker","unstructured":"Volker Diekert and Paul Gastin. 2008. First-order definable languages. In Logic and Automata: History and Perspectives (Texts in Logic and Games), Vol. 2. Amsterdam University Press, 261--306."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.91.0047"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371512"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45824-2_3"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"On Equivalence and Uniformisation Problems for Finite Transducers. In ICALP (LIPIcs), Vol. 55","volume":"125","author":"Filiot Emmanuel","year":"2016","unstructured":"Emmanuel Filiot, Isma\u00ebl Jecker, Christof L\u00f6ding, and Sarah Winter. 2016. On Equivalence and Uniformisation Problems for Finite Transducers. In ICALP (LIPIcs), Vol. 55. Schloss Dagstuhl, 125:1--125:14.","journal-title":"Schloss Dagstuhl"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2984450.2984453"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00308-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321466.321473"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.46"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-016-0416-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Jean Berstel. 1979. Transductions and Context-Free Languages. Teubner.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.161.10"},{"key":"e_1_3_2_1_25_1","volume-title":"A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR abs\/1306.3418","author":"Manuel Amaldev","year":"2013","unstructured":"Amaldev Manuel, Thomas Schwentick, and Thomas Zeume. 2013. A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR abs\/1306.3418 (2013)."},{"key":"e_1_3_2_1_26_1","unstructured":"Amaldev Manuel and Thomas Zeume. 2013. Two-Variable Logic on 2- Dimensional Structures. In CSL. 484--499."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Joachim Niehren Laurent Planque Jean-Marc Talbot and Sophie Tison. 2005. N-ary Queries by Tree Automata. In DBPL. 232--246. 10.1007\/11601524_14","DOI":"10.1007\/11601524_14"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75293"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1629683"},{"key":"e_1_3_2_1_30_1","volume-title":"Two-Variable Logic with Two Order Relations. LMCS 8, 1","author":"Schwentick Thomas","year":"2012","unstructured":"Thomas Schwentick and Thomas Zeume. 2012. Two-Variable Logic with Two Order Relations. LMCS 8, 1 (2012)."},{"key":"e_1_3_2_1_31_1","unstructured":"Larry J. Stockmeyer. 1974. The complexity of decision problems in automata theory and logic. Ph.D. Dissertation. Dept. of Electrical Engineering M.I.T."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/174703"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_1_34_1","volume-title":"Vardi and Pierre Wolper","author":"Moshe","year":"1986","unstructured":"Moshe Y. Vardi and Pierre Wolper. 1986. An automata-theoretic approach to automatic program verification. In lics86. 332--344."}],"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.3209181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:34:23Z","timestamp":1781854463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":34,"alternative-id":["10.1145\/3209108.3209181","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209181","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"}}]}}