{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:47Z","timestamp":1776316907420,"version":"3.50.1"},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,5,1]]},"DOI":"10.1587\/transinf.2022edp7098","type":"journal-article","created":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T22:24:59Z","timestamp":1682893499000},"page":"959-975","source":"Crossref","is-referenced-by-count":3,"title":["On Lookaheads in Regular Expressions with Backreferences"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Nariyoshi","family":"CHIDA","sequence":"first","affiliation":[{"name":"NTT Security Japan"},{"name":"Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tachio","family":"TERAUCHI","sequence":"additional","affiliation":[{"name":"Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] N. Chida and T. Terauchi, \u201cOn lookaheads in regular expressions with backreferences,\u201d Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, 2019, to appear."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M.L. Schmid, \u201cCharacterising REGEX languages by regular languages equipped with factor-referencing,\u201d Inf. Comput., vol.249, pp.1-17, 2016. 10.1016\/j.ic.2016.02.003","DOI":"10.1016\/j.ic.2016.02.003"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S.C. Kleene, \u201cRepresentation of events in nerve nets and finite automata,\u201d in Automata Studies, 1956. 10.1515\/9781400882618-002","DOI":"10.1515\/9781400882618-002"},{"key":"4","unstructured":"[4] A. Morihata, \u201cTranslation of regular expression with lookahead into finite state automaton,\u201d Computer Software, vol.29, no.1, pp.1_147-1_158, 2012."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M. Berglund, B. van der Merwe, and S. van Litsenborgh, \u201cRegular expressions with lookahead,\u201d J. Univers. Comput. Sci., vol.27, no.1, pp.324-340, 2021. 10.3897\/jucs.66330","DOI":"10.3897\/jucs.66330"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J.A. Brzozowski and E. Leiss, \u201cOn equations for regular languages, finite automata, and sequential networks,\u201d Theor. Comput. Sci., vol.10, no.1, pp.19-35, 1980. 10.1016\/0304-3975(80)90069-9","DOI":"10.1016\/0304-3975(80)90069-9"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] A.V. Aho, \u201cChapter 5-algorithms for finding patterns in strings,\u201d Algorithms and Complexity, ed. J. van Leeuwen, Handbook of Theoretical Computer Science, pp.255-300, Elsevier, Amsterdam, 1990. 10.1016\/b978-0-444-88071-0.50010-2","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] C. C\u00e2mpeanu, K. Salomaa, and S. Yu, \u201cA formal study of practical regular expressions,\u201d International Journal of Foundations of Computer Science, vol.14, no.06, pp.1007-1018, 2003. 10.1142\/s012905410300214x","DOI":"10.1142\/S012905410300214X"},{"key":"9","unstructured":"[9] M. Berglund and B. van der Merwe, \u201cRegular expressions with backreferences re-examined,\u201d Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, Aug. 28-30, 2017, ed. J. Holub and J. Zd\u00e1rek, pp.30-41, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 2017."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] B. Loring, D. Mitchell, and J. Kinder, \u201cSound regular expression semantics for dynamic symbolic execution of javascript,\u201d Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, New York, NY, USA, pp.425-438, Association for Computing Machinery, 2019. 10.1145\/3314221.3314645","DOI":"10.1145\/3314221.3314645"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A.K. Chandra and L.J. Stockmeyer, \u201cAlternation,\u201d 17th Annual Symposium on Foundations of Computer Science (sfcs 1976), pp.98-108, 1976. 10.1109\/sfcs.1976.4","DOI":"10.1109\/SFCS.1976.4"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] V. Komendantsky, \u201cMatching problem for regular expressions with variables,\u201d Trends in Functional Programming-13th International Symposium, TFP 2012, St. Andrews, UK, June 12-14, 2012, Revised Selected Papers, ed. H. Loidl and R. Pe\u00f1a, Lecture Notes in Computer Science, vol.7829, pp.149-166, Springer, 2012. 10.1007\/978-3-642-40447-4_10","DOI":"10.1007\/978-3-642-40447-4_10"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] N. Chida and T. Terauchi, \u201cRepairing dos vulnerability of real-world regexes,\u201d Proceedings of the 43rd IEEE Symposium on Security and Privacy, SP 2022, Los Alamitos, CA, USA, pp.1049-1066, IEEE Computer Society, May 2022. 10.1109\/sp46214.2022.9833597","DOI":"10.1109\/SP46214.2022.9833597"},{"key":"14","unstructured":"[14] B. Carle and P. Narendran, \u201cOn extended regular expressions,\u201d Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, ed. A. Dediu, A. Ionescu, and C. Mart\u00edn-Vide, Lecture Notes in Computer Science, vol.5457, pp.279-289, Springer, 2009."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] K. Thompson, \u201cProgramming techniques: Regular expression search algorithm,\u201d Commun. ACM, vol.11, no.6, pp.419-422, June 1968. 10.1145\/363347.363387","DOI":"10.1145\/363347.363387"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Sakarovitch, Elements of Automata Theory, Cambridge University Press, USA, 2009.","DOI":"10.1017\/CBO9781139195218"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/5\/E106.D_2022EDP7098\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T04:55:59Z","timestamp":1715316959000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/5\/E106.D_2022EDP7098\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022edp7098","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,1]]},"article-number":"2022EDP7098"}}