{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:00Z","timestamp":1772164080052,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["11-106278"],"award-info":[{"award-number":["11-106278"]}],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837647","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"284-297","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Kleenex: compiling nondeterministic transducers to deterministic streaming transducers"],"prefix":"10.1145","author":[{"given":"Bj\u00f8rn Bugge","family":"Grathwohl","sequence":"first","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Fritz","family":"Henglein","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Ulrik Terp","family":"Rasmussen","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark"}]},{"given":"Kristoffer Aalund","family":"S\u00f8holm","sequence":"additional","affiliation":[{"name":"Jobindex, Denmark"}]},{"given":"Sebastian Paaske","family":"T\u00f8rholm","sequence":"additional","affiliation":[{"name":"Jobindex, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Handbook of Theoretical Computer Science","author":"Aho A. V.","year":"1990","unstructured":"A. V. Aho . Algorithms for finding patterns in strings . In J. van Leeuwen, editor, Handbook of Theoretical Computer Science , volume Algorithms and Complexity (A), pages 255\u2013 300 . Elsevier and MIT Press , 1990 . A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume Algorithms and Complexity (A), pages 255\u2013300. Elsevier and MIT Press, 1990."},{"key":"e_1_3_2_1_2_1","unstructured":"ISBN 0-444-88071-2 and 0-262-22038-5.  ISBN 0-444-88071-2 and 0-262-22038-5."},{"key":"e_1_3_2_1_3_1","volume-title":"Pearson Education","author":"Aho A. V.","year":"2006","unstructured":"A. V. Aho , M. S. Lam , R. Sethi , and J. D. Ullman . Compilers: Principles, Techniques, and Tools . Pearson Education , 2006 . A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Pearson Education, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15579-1_35"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. Foundations of Software Technology and Teoretical Computer Science (FSTTCS)","author":"Alur R.","year":"2010","unstructured":"R. Alur and P. \u02c7 Cern ` y. Expressiveness of streaming string transducers . In Proc. Foundations of Software Technology and Teoretical Computer Science (FSTTCS) , 2010 . R. Alur and P. \u02c7 Cern`y. Expressiveness of streaming string transducers. In Proc. Foundations of Software Technology and Teoretical Computer Science (FSTTCS), 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925844.1926454"},{"key":"e_1_3_2_1_7_1","volume-title":"Languages and Programming","author":"Alur R.","year":"2011","unstructured":"R. Alur and J. Deshmukh . Nondeterministic streaming string transducers. Automata , Languages and Programming , 2011 . R. Alur and J. Deshmukh. Nondeterministic streaming string transducers. Automata, Languages and Programming, 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.65"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603151"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676981"},{"key":"e_1_3_2_1_11_1","first-page":"56","volume-title":"Implementation and Application of Automata","author":"Anselmo M.","unstructured":"M. Anselmo , D. Giammarresi , and S. Varricchio . Finite automata and non-self-embedding grammars . In Implementation and Application of Automata , pages 47\u2013 56 . Springer, 2003. M. Anselmo, D. Giammarresi, and S. Varricchio. Finite automata and non-self-embedding grammars. In Implementation and Application of Automata, pages 47\u201356. Springer, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00271-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_16"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873705"},{"key":"e_1_3_2_1_17_1","first-page":"48","volume-title":"Implementation and Application of Automata","author":"Borsotti A.","unstructured":"A. Borsotti , L. Breveglieri , S. C. Reghizzi , and A. Morzenti . From ambiguous regular expressions to deterministic parsing automata . In Implementation and Application of Automata , pages 35\u2013 48 . Springer, 2015. A. Borsotti, L. Breveglieri, S. C. Reghizzi, and A. Morzenti. From ambiguous regular expressions to deterministic parsing automata. In Implementation and Application of Automata, pages 35\u201348. Springer, 2015."},{"key":"e_1_3_2_1_18_1","first-page":"316","volume-title":"Implementation and Application of Automata","author":"Borsotti A.","unstructured":"A. Borsotti , L. Breveglieri , S. C. Reghizzi , and A. Morzenti . BSP: A parsing tool for ambiguous regular expressions . In Implementation and Application of Automata , pages 313\u2013 316 . Springer, 2015. A. Borsotti, L. Breveglieri, S. C. Reghizzi, and A. Morzenti. BSP: A parsing tool for ambiguous regular expressions. In Implementation and Application of Automata, pages 313\u2013316. Springer, 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150019.1136500"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2688"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"e_1_3_2_1_22_1","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Electrical Engineering and Computer Science Series . MIT Press and McGraw-Hill , 3d edition, 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press and McGraw-Hill, 3d edition, 2009."},{"key":"e_1_3_2_1_23_1","series-title":"LNCS","first-page":"228","volume-title":"VMCAI","author":"D\u2019Antoni L.","year":"2013","unstructured":"L. D\u2019Antoni and M. Veanes . Static Analysis of String Encoders and Decoders . In VMCAI 2013 , volume 7737 of LNCS , pages 209\u2013 228 . Springer Verlag, 2013. L. D\u2019Antoni and M. Veanes. Static Analysis of String Encoders and Decoders. In VMCAI 2013, volume 7737 of LNCS, pages 209\u2013228. Springer Verlag, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535849"},{"issue":"4","key":"e_1_3_2_1_25_1","first-page":"407","article-title":"Regular expressions: New results and open problems. Journal of Automata","volume":"10","author":"Ellul K.","year":"2005","unstructured":"K. Ellul , B. Krawetz , J. Shallit , and M.-w. Wang . Regular expressions: New results and open problems. Journal of Automata , Languages and Combinatorics , 10 ( 4 ): 407 \u2013 437 , 2005 . K. Ellul, B. Krawetz, J. Shallit, and M.-w. Wang. Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics, 10(4):407\u2013437, 2005.","journal-title":"Languages and Combinatorics"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/371316.371512"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065046"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1938551.1938556"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/982962.964011"},{"key":"e_1_3_2_1_30_1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/b96922","volume-title":"Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP)","author":"Frisch A.","year":"2004","unstructured":"A. Frisch and L. Cardelli . Greedy regular expression matching . In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP) , volume 3142 of Lecture notes in computer science , pages 618\u2013 629 , Turku, Finland, July 2004 . Springer . A. Frisch and L. Cardelli. Greedy regular expression matching. In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP), volume 3142 of Lecture notes in computer science, pages 618\u2013629, Turku, Finland, July 2004. Springer."},{"key":"e_1_3_2_1_31_1","first-page":"52068","volume-title":"O\u2019Reilly","author":"Goyvaerts J.","year":"2009","unstructured":"J. Goyvaerts and S. Levithan . Regular Expressions Cookbook . O\u2019Reilly , 2009 . ISBN 978-0-596- 52068 - 52067 . J. Goyvaerts and S. Levithan. Regular Expressions Cookbook. O\u2019Reilly, 2009. ISBN 978-0-596-52068-7."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39274-0_7"},{"key":"e_1_3_2_1_33_1","first-page":"240","volume-title":"11th International Colloquium","author":"Grathwohl N. B. B.","year":"2014","unstructured":"N. B. B. Grathwohl , F. Henglein , and U. T. Rasmussen . Optimally Streaming Greedy Regular Expression Parsing. In Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium , Bucharest, Romania , September 17-19, 2014 . Proceedings, pages 224\u2013 240 , 2014. N. B. B. Grathwohl, F. Henglein, and U. T. Rasmussen. Optimally Streaming Greedy Regular Expression Parsing. In Theoretical Aspects of Computing - ICTAC 2014 - 11th International Colloquium, Bucharest, Romania, September 17-19, 2014. Proceedings, pages 224\u2013 240, 2014."},{"key":"e_1_3_2_1_34_1","volume-title":"Department of Mathematics","author":"Graulund C.","year":"2015","unstructured":"C. Graulund . On automata-theoretic characterizations of regular expressions as types. Bachelor Thesis , Department of Mathematics , University of Copenhagen , May 2015 . C. Graulund. On automata-theoretic characterizations of regular expressions as types. Bachelor Thesis, Department of Mathematics, University of Copenhagen, May 2015."},{"key":"e_1_3_2_1_35_1","volume-title":"January 3","author":"Hazel P.","year":"2010","unstructured":"P. Hazel . PCRE \u2013 Perl-compatible regular expressions. Concatenation of PCRE man pages , January 3 2010 . P. Hazel. PCRE \u2013 Perl-compatible regular expressions. Concatenation of PCRE man pages, January 3 2010."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925844.1926429"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2031"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210803"},{"key":"e_1_3_2_1_39_1","volume-title":"The Oniguruma regular expression library","author":"Kosako K.","year":"2014","unstructured":"K. Kosako . The Oniguruma regular expression library , 2014 . URL http:\/\/www.geocities.jp\/kosako3\/oniguruma\/. K. Kosako. The Oniguruma regular expression library, 2014. URL http:\/\/www.geocities.jp\/kosako3\/oniguruma\/."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/549365"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505242"},{"key":"e_1_3_2_1_42_1","unstructured":"M. Lutz. Programming Python volume 8. O\u2019Reilly 4th edition edition December 2010. ISBN 978-0-596-15810-1.   M. Lutz. Programming Python volume 8. O\u2019Reilly 4th edition edition December 2010. ISBN 978-0-596-15810-1."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":". URL http:\/\/dx.doi.org\/10.1109\/TEC.1960.5221603.    10.1109\/TEC.1960.5221603\n. URL http:\/\/dx.doi.org\/10.1109\/TEC.1960.5221603.","DOI":"10.1109\/TEC.1960.5221603"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/972695.972698"},{"key":"e_1_3_2_1_46_1","first-page":"103","volume-title":"Combinatorial Pattern Matching","author":"Myers E.","unstructured":"E. Myers , P. Oliva , and K. Guimar\u02dcaes . Reporting exact and approximate regular expression matches . In Combinatorial Pattern Matching , pages 91\u2013 103 . Springer, 1998. E. Myers, P. Oliva, and K. Guimar\u02dcaes. Reporting exact and approximate regular expression matches. In Combinatorial Pattern Matching, pages 91\u2013103. Springer, 1998."},{"key":"e_1_3_2_1_47_1","volume-title":"Approximate matching of regular expressions. Bulletin of mathematical biology, 51(1):5\u201337","author":"Myers E. W.","year":"1989","unstructured":"E. W. Myers and W. Miller . Approximate matching of regular expressions. Bulletin of mathematical biology, 51(1):5\u201337 , 1989 . E. W. Myers and W. Miller. Approximate matching of regular expressions. Bulletin of mathematical biology, 51(1):5\u201337, 1989."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/128749.128755"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541988"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/647258.720794"},{"key":"e_1_3_2_1_51_1","series-title":"Lecture Notes in Computer Science (LNCS)","first-page":"413","volume-title":"Proc. 5th Int\u2019l Conf. on Language and Automata Theory and Applications (LATA)","author":"Nielsen L.","unstructured":"L. Nielsen and F. Henglein . Bit-coded regular expression parsing . In Proc. 5th Int\u2019l Conf. on Language and Automata Theory and Applications (LATA) , Lecture Notes in Computer Science (LNCS) , pages 402\u2013 413 . Springer, May 2011. L. Nielsen and F. Henglein. Bit-coded regular expression parsing. In Proc. 5th Int\u2019l Conf. on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science (LNCS), pages 402\u2013413. Springer, May 2011."},{"key":"e_1_3_2_1_52_1","series-title":"Lecture Notes in Computer Science","first-page":"240","volume-title":"Implementation and Application of Automata","author":"Okui S.","unstructured":"S. Okui and T. Suzuki . Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions . In M. Domaratzki and K. Salomaa, editors, Implementation and Application of Automata , volume 6482 of Lecture Notes in Computer Science , pages 231\u2013 240 . Springer Berlin Heidelberg, 2011. ISBN 978-3-642-18097-2.. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-18098-9_25. 10.1007\/978-3-642-18098-9_25 S. Okui and T. Suzuki. Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions. In M. Domaratzki and K. Salomaa, editors, Implementation and Application of Automata, volume 6482 of Lecture Notes in Computer Science, pages 231\u2013240. Springer Berlin Heidelberg, 2011. ISBN 978-3-642-18097-2.. URL http:\/\/dx.doi.org\/10.1007\/978-3-642-18098-9_25."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_32"},{"key":"e_1_3_2_1_54_1","volume-title":"Static analysis for regular expression exponential runtime via substructural logics. CoRR, abs\/1405.7058","author":"Rathnayake A.","year":"2014","unstructured":"A. Rathnayake and H. Thielecke . Static analysis for regular expression exponential runtime via substructural logics. CoRR, abs\/1405.7058 , 2014 . A. Rathnayake and H. Thielecke. Static analysis for regular expression exponential runtime via substructural logics. CoRR, abs\/1405.7058, 2014."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90055-X"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/1058426.1058885"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694368"},{"key":"e_1_3_2_1_58_1","first-page":"11","volume-title":"IPSJ Transactions on Programming, number 3 in 7","author":"Sugiyama S.","year":"2014","unstructured":"S. Sugiyama and Y. Minamide . Checking time linearity of regular expression matching based on backtracking . In IPSJ Transactions on Programming, number 3 in 7 , pages 1\u2013 11 , 2014 . S. Sugiyama and Y. Minamide. Checking time linearity of regular expression matching based on backtracking. In IPSJ Transactions on Programming, number 3 in 7, pages 1\u201311, 2014."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2370776.2370788"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07151-0_13"},{"key":"e_1_3_2_1_61_1","volume-title":"CNRS","author":"Talbot J.-M.","year":"2014","unstructured":"J.-M. Talbot and P.-A. Reynier . Visibly Pushdown Transducers with Well-nested Outputs. Technical report, Aix Marseille Universite , CNRS , 2014 . URL https:\/\/hal.archives-ouvertes.fr\/ hal-00988129\/. J.-M. Talbot and P.-A. Reynier. Visibly Pushdown Transducers with Well-nested Outputs. Technical report, Aix Marseille Universite, CNRS, 2014. URL https:\/\/hal.archives-ouvertes.fr\/ hal-00988129\/."},{"key":"e_1_3_2_1_62_1","unstructured":"The GNU Project 2015. URL http:\/\/www.gnu.org\/software\/ coreutils\/coreutils.html.  The GNU Project 2015. URL http:\/\/www.gnu.org\/software\/ coreutils\/coreutils.html."},{"key":"e_1_3_2_1_63_1","unstructured":"The Hyperscan authors. Hyperscan October 2015. URL https: \/\/01.org\/hyperscan.  The Hyperscan authors. Hyperscan October 2015. URL https: \/\/01.org\/hyperscan."},{"key":"e_1_3_2_1_64_1","unstructured":"The RE2 authors. RE2 2015. URL https:\/\/github.com\/google\/ re2.  The RE2 authors. RE2 2015. URL https:\/\/github.com\/google\/ re2."},{"key":"e_1_3_2_1_65_1","unstructured":"The RE2J authors. RE2J 2015. URL https:\/\/github.com\/ google\/re2j.  The RE2J authors. RE2J 2015. URL https:\/\/github.com\/ google\/re2j."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_2_1_67_1","unstructured":"A. Thurston. Ragel state machine compiler 2015. URL http: \/\/www.colm.net\/open-source\/ragel\/.  A. Thurston. Ragel state machine compiler 2015. URL http: \/\/www.colm.net\/open-source\/ragel\/."},{"issue":"3","key":"e_1_3_2_1_68_1","first-page":"263","article-title":"van Noord and D","volume":"4","author":"G","year":"2001","unstructured":"G . van Noord and D . Gerdemann. Finite State Transducers with Predicates and Identities. Grammars , 4 ( 3 ): 263 \u2013 286 , 2001 . ISSN 1386-7393. G. van Noord and D. Gerdemann. Finite State Transducers with Predicates and Identities. Grammars, 4(3):263\u2013286, 2001. ISSN 1386-7393.","journal-title":"Gerdemann. Finite State Transducers with Predicates and Identities. Grammars"},{"key":"e_1_3_2_1_69_1","volume-title":"Symbolic String Transformations with Regular Lookahead and Rollback. In Ershov Informatics Conference (PSI\u201914)","author":"Veanes M.","year":"2014","unstructured":"M. Veanes . Symbolic String Transformations with Regular Lookahead and Rollback. In Ershov Informatics Conference (PSI\u201914) . Springer Verlag , 2014 . M. Veanes. Symbolic String Transformations with Regular Lookahead and Rollback. In Ershov Informatics Conference (PSI\u201914). Springer Verlag, 2014."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103674"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677014"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"e_1_3_2_1_73_1","volume-title":"Programming Perl. O\u2019Reilly","author":"Wall L.","year":"2000","unstructured":"L. Wall , T. Christiansen , and J. Orwant . Programming Perl. O\u2019Reilly , 3 rd edition, July 2000 . L. Wall, T. Christiansen, and J. Orwant. Programming Perl. O\u2019Reilly, 3rd edition, July 2000.","edition":"3"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1017\/S135132499700154X"},{"key":"e_1_3_2_1_75_1","volume-title":"Practical programming in Tcl and Tk","author":"Welch B. B.","year":"2003","unstructured":"B. B. Welch , K. Jones , and J. Hobbs . Practical programming in Tcl and Tk . Prentice Hall , 4 th edition edition, 2003 . ISBN 0130385603. B. B. Welch, K. Jones, and J. Hobbs. Practical programming in Tcl and Tk. Prentice Hall, 4th edition edition, 2003. ISBN 0130385603.","edition":"4"},{"key":"e_1_3_2_1_76_1","first-page":"153","article-title":"Agrep\u2013a fast approximate pattern-matching tool","author":"Wu S.","year":"1992","unstructured":"S. Wu and U. Manber . Agrep\u2013a fast approximate pattern-matching tool . Usenix Winter 1992 , pages 153 \u2013 162 , 1992. S. Wu and U. Manber. Agrep\u2013a fast approximate pattern-matching tool. Usenix Winter 1992, pages 153\u2013162, 1992.","journal-title":"Usenix"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396556.2396594"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:38Z","timestamp":1750211018000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":77,"alternative-id":["10.1145\/2837614.2837647","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837647","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837647","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}