{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:08:18Z","timestamp":1774987698402,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 1138996"],"award-info":[{"award-number":["CCF 1138996"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603151","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Regular combinators for string transformations"],"prefix":"10.1145","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Adam","family":"Freilich","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]},{"given":"Mukund","family":"Raghothaman","sequence":"additional","affiliation":[{"name":"University of Pennsylvania"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01703920"},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs 8","author":"Alur R.","year":"2010","unstructured":"R. Alur and P. \u010cern\u00fd . Expressiveness of streaming string transducers . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs 8 , pages 1 -- 12 , 2010 . R. Alur and P. \u010cern\u00fd. Expressiveness of streaming string transducers. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs 8, pages 1--12, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926454"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.65"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.18"},{"key":"e_1_3_2_1_7_1","volume-title":"41st International Colloquium, ICALP Part II","author":"Bojanczyk M.","year":"2014","unstructured":"M. Bojanczyk . Transducers with origin information. In Automata, Languages, and Programming --- 41st International Colloquium, ICALP Part II , 2014 . Forthcoming. M. Bojanczyk. Transducers with origin information. In Automata, Languages, and Programming --- 41st International Colloquium, ICALP Part II, 2014. Forthcoming."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805950.1805953"},{"key":"e_1_3_2_1_9_1","first-page":"135","volume-title":"4th International Colloquium, LNCS 52","author":"Chytil M.","year":"1977","unstructured":"M. Chytil and V. J\u00e1kl . Serial composition of 2-way finite-state transducers and simple programs on strings. In Automata, Languages and Programming --- 4th International Colloquium, LNCS 52 , pages 135 -- 147 . 1977 . M. Chytil and V. J\u00e1kl. Serial composition of 2-way finite-state transducers and simple programs on strings. In Automata, Languages and Programming --- 4th International Colloquium, LNCS 52, pages 135--147. 1977."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"e_1_3_2_1_11_1","first-page":"124","volume-title":"17th Colloquium on Trees in Algebra and Programming, LNCS 581","author":"Courcelle B.","year":"1992","unstructured":"B. Courcelle . Monadic second-order graph transductions . In 17th Colloquium on Trees in Algebra and Programming, LNCS 581 , pages 124 -- 144 . 1992 . B. Courcelle. Monadic second-order graph transductions. In 17th Colloquium on Trees in Algebra and Programming, LNCS 581, pages 124--144. 1992."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1667106"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371512"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2807"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.46"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to the Theory of Computation. Cengage Learning","author":"Sipser Michael","year":"2012","unstructured":"Michael Sipser . Introduction to the Theory of Computation. Cengage Learning , 3 rd edition, 2012 . Michael Sipser. Introduction to the Theory of Computation. Cengage Learning, 3rd edition, 2012.","edition":"3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103674"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","location":"Vienna Austria","acronym":"CSL-LICS '14","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603151","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:41Z","timestamp":1750230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":18,"alternative-id":["10.1145\/2603088.2603151","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603151","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}