{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T05:54:30Z","timestamp":1746770070675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479625"},{"type":"electronic","value":"9783031479632"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47963-2_14","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:41:26Z","timestamp":1700689286000},"page":"216-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a0Checking Intersection Non-emptiness of\u00a0Regular Expressions"],"prefix":"10.1007","author":[{"given":"Weihao","family":"Su","sequence":"first","affiliation":[]},{"given":"Rongchen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chengyao","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Haiming","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., et al.: Efficient handling of string-number conversion. In: PLDI 2020, pp. 943\u2013957 (2020)","DOI":"10.1145\/3385412.3386034"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155, 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G Berry","year":"1986","unstructured":"Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48, 117\u2013126 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2022.12.009","volume":"943","author":"M Berzish","year":"2023","unstructured":"Berzish, M., et al.: Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943, 50\u201372 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Berzish, M., Ganesh, V., Zheng, Y.: Z3str3: a string solver with theory-aware heuristics. In: FMCAD 2017, pp. 55\u201359 (2017)","DOI":"10.23919\/FMCAD.2017.8102241"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120, 197\u2013213 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 140(2), 229\u2013253 (1998)","journal-title":"Inf. Comput."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2019.01.003","volume":"265","author":"S Broda","year":"2019","unstructured":"Broda, S., Holzer, M., Maia, E., Moreira, N., Reis, R.: A mesh of automata. Inf. Comput. 265, 94\u2013111 (2019)","journal-title":"Inf. Comput."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-662-53132-7_5","volume-title":"Developments in Language Theory","author":"S Broda","year":"2016","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Position automaton construction for regular expressions with intersection. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 51\u201363. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53132-7_5"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179\u2013191. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_13"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1142\/S021819670700355X","volume":"17","author":"JM Champarnaud","year":"2007","unstructured":"Champarnaud, J.M., Ouardi, F., Ziadi, D.: Normalized expressions and finite automata. Int. J. Algebra Comput. 17, 141\u2013154 (2007)","journal-title":"Int. J. Algebra Comput."},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"JM Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theor. Comput. Sci. 289(1), 137\u2013163 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-56024-6_8","volume-title":"Combinatorial Pattern Matching","author":"C-H Chang","year":"1992","unstructured":"Chang, C.-H., Paige, R.: From regular expressions to DFA\u2019s using compressed NFA\u2019s. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1992. LNCS, vol. 644, pp. 90\u2013110. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56024-6_8"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Chapman, C., Stolee, K.T.: Exploring regular expression usage and context in Python. In: ISSTA 2016, pp. 282\u2013293 (2016)","DOI":"10.1145\/2931037.2931073"},{"key":"14_CR16","unstructured":"Chen, H.: Finite automata of expressions in the case of star normal form and one-unambiguity. Technical report. ISCAS-LCS-10-11 (2010)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-16142-2_20","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Chen","year":"2019","unstructured":"Chen, H., Li, Y., Dong, C., Chu, X., Mou, X., Min, W.: A large-scale repository of deterministic regular expression patterns and its applications. In: Yang, Q., Zhou, Z.-H., Gong, Z., Zhang, M.-L., Huang, S.-J. (eds.) PAKDD 2019. LNCS (LNAI), vol. 11441, pp. 249\u2013261. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16142-2_20"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-53733-7_17","volume-title":"Language and Automata Theory and Applications","author":"H Chen","year":"2017","unstructured":"Chen, H., Lu, P.: Derivatives and finite automata of expressions in star normal form. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 236\u2013248. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_17"},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2020.102436","volume":"193","author":"H Chen","year":"2020","unstructured":"Chen, H., Xu, Z.: Inclusion algorithms for one-unambiguous regular expressions and their applications. Sci. Comput. Program. 193, 102436 (2020)","journal-title":"Sci. Comput. Program."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-27654-5_27","volume-title":"Computation, Physics and Beyond","author":"H Chen","year":"2012","unstructured":"Chen, H., Yu, S.: Derivatives of regular expressions and an application. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) WTCS 2012. LNCS, vol. 7160, pp. 343\u2013356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27654-5_27"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Chen, T., et al.: Solving string constraints with regex-dependent functions through transducers with priorities and variables. In: POPL 2022, vol. 6, pp. 1\u201331 (2022)","DOI":"10.1145\/3498707"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"issue":"35","key":"14_CR23","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.tcs.2009.04.009","volume":"410","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35), 3281\u20133289 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Guanciale, R., Gurov, D., Laud, P.: Private intersection of regular languages. In: PST 2014, pp. 112\u2013120 (2014)","DOI":"10.1109\/PST.2014.6890930"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60630-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"JG Henriksen","year":"1995","unstructured":"Henriksen, J.G., et al.: Mona: monadic second-order logic in practice. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 89\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60630-0_5"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44977-9_14","volume-title":"Implementation and Application of Automata","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: State complexity of basic operations on nondeterministic finite automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 148\u2013157. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44977-9_14"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","volume":"12","author":"HB Hunt","year":"1976","unstructured":"Hunt, H.B., Rosenkrantz, D.J., Szymanski, T.G.: On the equivalence, containment, and covering problems for the regular and context-free languages. J. Comput. Syst. Sci. 12(2), 222\u2013268 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","volume":"186","author":"L Ilie","year":"2003","unstructured":"Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: SFCS 1977, pp. 254\u2013266 (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Le Glaunec, A., Kong, L., Mamouras, K.: Regular expression matching using bit vector automata. In: OOPSLA 2023, vol. 7, pp. 492\u2013521 (2023)","DOI":"10.1145\/3586044"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-28756-5_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Leng\u00e1l","year":"2012","unstructured":"Leng\u00e1l, O., \u0160im\u00e1\u010dek, J., Vojnar, T.: VATA: a library for efficient manipulation of non-deterministic tree automata. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 79\u201394. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_7"},{"key":"14_CR32","unstructured":"Li, Y., et al.: ReDoSHunter: a combined static and dynamic approach for regular expression DoS detection. In: USENIX Security 2021, pp. 3847\u20133864 (2021)"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-24246-0_9","volume-title":"Frontiers of Combining Systems","author":"T Liang","year":"2015","unstructured":"Liang, T., Tsiskaridze, N., Reynolds, A., Tinelli, C., Barrett, C.: A decision procedure for regular membership and length constraints over unbounded strings. In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 135\u2013150. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24246-0_9"},{"key":"14_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. 9, 39\u201347 (1960)","journal-title":"IRE Trans. Electron. Comput."},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Middleton, J., Toro Icarte, R., Baier, J.: Real-time heuristic search with LTLf goals. In: IJCAI 2022, pp. 4785\u20134792 (2022)","DOI":"10.24963\/ijcai.2022\/663"},{"key":"14_CR36","unstructured":"M\u00f8ller, A.: dk.brics.automaton. https:\/\/www.brics.dk\/automaton\/"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-48516-0_6","volume-title":"Developments in Language Theory","author":"M de Oliveira Oliveira","year":"2020","unstructured":"de Oliveira Oliveira, M., Wehar, M.: On the fine grained complexity of finite automata non-emptiness of intersection. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 69\u201382. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_6"},{"issue":"2","key":"14_CR38","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Stanford, C., Veanes, M., Bj\u00f8rner, N.: Symbolic Boolean derivatives for efficiently solving extended regular expression constraints. In: PLDI 2021, pp. 620\u2013635 (2021)","DOI":"10.1145\/3410296"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-44674-5_26","volume-title":"Implementation and Application of Automata","author":"H Todd Wareham","year":"2001","unstructured":"Todd Wareham, H.: The parameterized complexity of intersection and composition operations on sets of finite-state automata. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 302\u2013310. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44674-5_26"},{"key":"14_CR41","unstructured":"Wang, X., Hong, Y., Chang, H., Langdale, G., Hu, J.: Hyperscan: a fast multi-pattern regex matcher for modern CPUs. In: NSDI 2019, pp. 631\u2013648 (2019)"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-43951-7_30","volume-title":"Automata, Languages, and Programming","author":"M Wehar","year":"2014","unstructured":"Wehar, M.: Hardness results for intersection non-emptiness. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 354\u2013362. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_30"},{"key":"14_CR43","unstructured":"Xu, X.: JAltImpact. https:\/\/github.com\/cathiec\/JAltImpact"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Handbook of Formal Languages, vol. 1: Word, Language, Grammar, pp. 41\u2013110 (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"3","key":"14_CR45","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/126537.126543","volume":"22","author":"S Yu","year":"1991","unstructured":"Yu, S., Zhuang, Q.: On the state complexity of intersection of regular languages. ACM SIGACT News 22(3), 52\u201354 (1991)","journal-title":"ACM SIGACT News"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Ziadi, D., Ponty, J.L., Champarnaud, J.M.: Passage d\u2019une expression rationnelle \u00e0 un automate fini non-d\u00e9terministe. Bull. Belg. Math. Soc. - Simon Stevin 4, 177\u2013203 (1997)","DOI":"10.36045\/bbms\/1105730628"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47963-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:42:46Z","timestamp":1700689366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47963-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479625","9783031479632"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47963-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2023.compsust.utec.edu.pe\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}