{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:58Z","timestamp":1740109378620,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T00:00:00Z","timestamp":1705104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T00:00:00Z","timestamp":1705104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["RS-2023-00208094","RS-2023-00208094","RS-2023-00208094"],"award-info":[{"award-number":["RS-2023-00208094","RS-2023-00208094","RS-2023-00208094"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00224-023-10160-w","type":"journal-article","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T09:02:51Z","timestamp":1705136571000},"page":"301-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Decidability of Infix Inclusion Problem"],"prefix":"10.1007","volume":"68","author":[{"given":"Hyunjoon","family":"Cheon","sequence":"first","affiliation":[]},{"given":"Joonghyuk","family":"Hahn","sequence":"additional","affiliation":[]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,13]]},"reference":[{"key":"10160_CR1","doi-asserted-by":"crossref","unstructured":"Chapman, C., Stolee, K.T.: Exploring regular expression usage and context in Python. In: Proceedings of the 25th international symposium on software testing and analysis, pp 282\u2013293 (2016)","DOI":"10.1145\/2931037.2931073"},{"key":"10160_CR2","doi-asserted-by":"crossref","unstructured":"Davis, J.C., Michael IV, L.G., Coghlan, C.A., Servant, F., Lee, D.: Why aren\u2019t regular expressions a lingua franca? an empirical study on the reuse and portability of regular expressions. In: Proceedings of the 27th ACM joint meeting on European software engineering conference and symposium on the foundations of software engineering, pp 443\u2013454 (2019)","DOI":"10.1145\/3338906.3338909"},{"key":"10160_CR3","doi-asserted-by":"crossref","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Elect. Comput. EC-9(1), 39\u201347 (1960)","DOI":"10.1109\/TEC.1960.5221603"},{"issue":"6","key":"10160_CR4","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"key":"10160_CR5","unstructured":"Spencer, H.: A regular-expression matcher. In: Software solutions in C, academic press professional, Inc., MA, USA, pp 35\u201371 (1994)"},{"key":"10160_CR6","doi-asserted-by":"crossref","unstructured":"Berglund, M., Drewes, F., van der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. In: Proceedings of the 14th international conference on automata and formal languages, pp 109\u2013123 (2014)","DOI":"10.4204\/EPTCS.151.7"},{"key":"10160_CR7","doi-asserted-by":"crossref","unstructured":"Davis, J.C., Coghlan, C.A., Servant, F., Lee, D.: The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale. In: Proceedings of the 26th ACM joint meeting on European software engineering conference and symposium on the foundations of software engineering, pp 246\u2013256 (2018)","DOI":"10.1145\/3236024.3236027"},{"key":"10160_CR8","doi-asserted-by":"crossref","unstructured":"W\u00fcstholz, V., Olivo, O., Heule, M.J.H., Dillig, I.: Static detection of DoS vulnerabilities in programs that use regular expressions. In: Proceedings of the 23rd international conference on tools and algorithms for the construction and analysis of systems, Part II, pp 3\u201320 (2017)","DOI":"10.1007\/978-3-662-54580-5_1"},{"key":"10160_CR9","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of the 13th annual symposium on switching and automata theory, pp 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"issue":"3\u20134","key":"10160_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.3233\/FI-2016-1434","volume":"148","author":"C C\u00e2mpeanu","year":"2016","unstructured":"C\u00e2mpeanu, C., Moreira, N., Reis, R.: Distinguishability operations and closures. Fund. Informaticae 148(3\u20134), 243\u2013266 (2016)","journal-title":"Distinguishability operations and closures. Fund. Informaticae"},{"key":"10160_CR11","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Automata, Language Combinator. 21(4), 251\u2013310 (2017)"},{"key":"10160_CR12","doi-asserted-by":"crossref","unstructured":"Pribavkina, E.V., Rodaro, E.: State complexity of prefix, suffix, bifix and infix operators on regular languages. In: Proceedings of the 14th international conference on developments in language theory, pp 376\u2013386 (2010)","DOI":"10.1007\/978-3-642-14455-4_34"},{"issue":"7","key":"10160_CR13","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1142\/S0129054111008957","volume":"22","author":"EV Pribavkina","year":"2011","unstructured":"Pribavkina, E.V., Rodaro, E.: State complexity of code operators. Int. J. Found. Comput. Sci. 22(7), 1669\u20131681 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10160_CR14","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the 36th annual ACM symposium on theory of computing, pp 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"10160_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.tcs.2022.03.024","volume":"918","author":"V Geffert","year":"2022","unstructured":"Geffert, V., Bedn\u00e1ron\u00e1, Z., Szabari, A.: Input-driven pushdown automata for edit distance neighborhood. Theoretical Comput. Sci. 918, 105\u2013122 (2022)","journal-title":"Theoretical Comput. Sci."},{"key":"10160_CR16","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2013","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Cengage Learning, MA, USA (2013)","edition":"3"},{"key":"10160_CR17","volume-title":"Theory of Computation","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. Harper & Row, NY, USA (1987)"},{"key":"10160_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity - A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach. Cambridge University Press, UK (2009)"},{"key":"10160_CR19","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Stockmeyer, L.J.: Alternation. In: Proceedings of the 17th annual symposium on foundations of compuer science, pp 98\u2013108 (1974)","DOI":"10.1109\/SFCS.1976.4"},{"key":"10160_CR20","unstructured":"Clemente, L.: On the complexity of the universality and inclusion problems for unambiguous context-free grammars. In: Proceedings of the 8th international workshop on verification and program transformation and 7th workshop on horn clauses for verification and synthesis, pp 29\u201343 (2020)"},{"key":"10160_CR21","doi-asserted-by":"crossref","unstructured":"Bousquet, N., L\u00f6ding, C.: Equivalence and inclusion problem for strongly unambiguious B\u00fcchi automata. In: Proceedings of the 4th international conference on language and automata theory and applications, pp 118\u2013129 (2010)","DOI":"10.1007\/978-3-642-13089-2_10"},{"key":"10160_CR22","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Ducobu, M., Gauwin, O.: Visibly pushdown automata: Universality and inclusion via antichains. In: Proceedings of the 7th international conference on language and automata theory and applications, pp 190\u2013201 (2013)","DOI":"10.1007\/978-3-642-37064-9_18"},{"issue":"11","key":"10160_CR23","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1016\/j.ic.2009.03.003","volume":"207","author":"J Champav\u00e8re","year":"2009","unstructured":"Champav\u00e8re, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient inclusion checking for deterministic tree automata and XML schemas. Inf. Comput. 207(11), 1181\u20131208 (2009)","journal-title":"Inf. Comput."},{"issue":"1","key":"10160_CR24","first-page":"12","volume":"15","author":"L Clemente","year":"2019","unstructured":"Clemente, L., Mayr, R.: Efficient reduction of nondeterministic automata with application to language inclusion testing. Logical Methods Comput. Sci. 15(1), 12\u201311273 (2019)","journal-title":"Logical Methods Comput. Sci."},{"key":"10160_CR25","doi-asserted-by":"crossref","unstructured":"Cheon, H., Hahn, J., Han, Y.-S.: On the decidability of infix inclusion problem. In: Proceedings of the 26th international conference on developments in language theory, pp 115\u2013126 (2022)","DOI":"10.1007\/978-3-031-05578-2_9"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10160-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10160-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10160-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T00:29:28Z","timestamp":1731025768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10160-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,13]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["10160"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10160-w","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,1,13]]},"assertion":[{"value":"19 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}