{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:36:24Z","timestamp":1742938584689,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031055775"},{"type":"electronic","value":"9783031055782"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05578-2_9","type":"book-chapter","created":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:22Z","timestamp":1652029582000},"page":"115-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Decidability of\u00a0Infix Inclusion Problem"],"prefix":"10.1007","author":[{"given":"Hyunjoon","family":"Cheon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joonghyuk","family":"Hahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"9_CR1","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":"9_CR2","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, Cambridge (2009)"},{"key":"9_CR3","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":"9_CR4","unstructured":"Berglund, M., van der Merwe, B.: Regular expressions with backreferences re-examined. In: Proceedings of the Prague Stringology Conference 2017, pp. 30\u201341 (2017)"},{"key":"9_CR5","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":"9_CR6","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":"3\u20134","key":"9_CR7","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. Fundamenta Informaticae 148(3\u20134), 243\u2013266 (2016)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Stockmeyer, L.J.: Alternation. In: Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pp. 98\u2013108 (1974)","DOI":"10.1109\/SFCS.1976.4"},{"key":"9_CR9","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":"9_CR10","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)"},{"issue":"1","key":"9_CR11","first-page":"12:1","volume":"15","author":"L Clemente","year":"2019","unstructured":"Clemente, L., Mayr, R.: Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15(1), 12:1-12:73 (2019)","journal-title":"Log. Methods Comput. Sci."},{"key":"9_CR12","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":"9_CR13","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 re-use 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"},{"issue":"02","key":"9_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1142\/S0129054118400051","volume":"29","author":"J Eremondi","year":"2018","unstructured":"Eremondi, J., Ibaraa, O.H., McQuillan, I.: On the density of context-free and counter languages. Int. J. Found. Comput. Sci. 29(02), 233\u2013250 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ic.2017.07.009","volume":"256","author":"J Eremondi","year":"2017","unstructured":"Eremondi, J., Ibarra, O.H., McQuillan, I.: Deletion operations on deterministic families of automata. Inf. Comput. 256, 237\u2013252 (2017)","journal-title":"Inf. Comput."},{"issue":"4","key":"9_CR16","first-page":"251","volume":"21","author":"Y Gao","year":"2017","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. J. Autom. Lang. Combin. 21(4), 251\u2013310 (2017)","journal-title":"J. Autom. Lang. Combin."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Kirrage, J., Rathnayake, A., Thielecke, H.: Static analysis for regular expression denial-of-service attacks. In: Proceedings of the 7th International Conference on Network and System Security, pp. 135\u2013148 (2013)","DOI":"10.1007\/978-3-642-38631-2_11"},{"issue":"1","key":"9_CR18","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. EC. 9(1), 39\u201347 (1960)","journal-title":"IRE Trans. Electron. Comput. EC."},{"key":"9_CR19","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":"9_CR20","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":"9_CR21","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, Boston (2013)","edition":"3"},{"key":"9_CR22","unstructured":"Spencer, H.: A regular-expression matcher. In: Software Solutions in C, pp. 35\u201371. Academic Press Professional, Inc. (1994)"},{"issue":"6","key":"9_CR23","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":"9_CR24","volume-title":"Theory of Computation","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. Harper & Row, New York (1987)"},{"key":"9_CR25","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"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05578-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T02:20:28Z","timestamp":1727144428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05578-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031055775","9783031055782"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05578-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.usf.edu\/arts-sciences\/conferences\/dlt2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}