{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:39:28Z","timestamp":1743093568495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"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-33264-7_6","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"61-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weak Inverse Neighborhoods of\u00a0Languages"],"prefix":"10.1007","author":[{"given":"Hyunjoon","family":"Cheon","sequence":"first","affiliation":[]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0201019","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Peterson, T.G.: A minimum distance error-correcting parser for context-free languages. SAIM J. Comput. 1(4), 281\u2013353 (1972)","journal-title":"SAIM J. Comput."},{"issue":"8","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.jcss.2013.06.001","volume":"79","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8), 1302\u20131321 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"6_CR3","first-page":"324","volume":"27","author":"M Berglund","year":"2021","unstructured":"Berglund, M., van der Merwe, B., van Litsenborgh, S.: Regular expressions with lookahead. J. Univ. Comput. Sci. 27(4), 324\u2013340 (2021)","journal-title":"J. Univ. Comput. Sci."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bispo, J., Sourdis, I., Cardoso, J.M., Vassiliadis, S.: Regular expression matching for reconfigurable packet inspection. In: Proceedings of the 2006 IEEE International Conference on Field Programmable Technology (FPT), pp. 119\u2013126 (2006)","DOI":"10.1109\/FPT.2006.270302"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty, D., Das, D., Goldenberg, E., Kouck\u00fd, M., Saks, M.: Approximating edit distance within constant factor in truly sub-quadratic time. J. ACM 67(6), 36:1\u201336:22 (2020)","DOI":"10.1145\/3422823"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chapman, C., Stollee, K.T.: Exploring regular expression usage and context in Python. In: Proceedings of the 25th International Symposium on Software Testing and Analysis (ISSTA), pp. 282\u2013293 (2016)","DOI":"10.1145\/2931037.2931073"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cheon, H., Hahn, J., Han, Y.S., Ko, S.K.: Most pseudo-copy languages are not context-free. In: Proceedings of the 27th International Computing and Combinatorics Conference (COCOON), pp. 189\u2013200 (2021)","DOI":"10.1007\/978-3-030-89543-3_16"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cheon, H., Han, Y.S.: Computing the shortest string and the edit-distance for parsing expression languages. In: Proceedings of the 24th International Conference on Developments in Language Theory (DLT), pp. 43\u201354 (2020)","DOI":"10.1007\/978-3-030-48516-0_4"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Transactions on Algorithms 3(1), 2:1\u20132:19 (2007)","DOI":"10.1145\/1186810.1186812"},{"key":"6_CR10","unstructured":"Ecma International: ECMA-262: ECMAScript(R) 2015 language specification. In: ECMA International (2015)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: A recognition-based syntactic foundation. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 111\u2013122 (2004)","DOI":"10.1145\/964001.964011"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Han, Y.S., Ko, S.K.: Edit-distance between visibly pushdown languages. In: Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp. 196\u2013207 (2017)","DOI":"10.1007\/978-3-319-51963-0_30"},{"issue":"7","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1142\/S0129054113400315","volume":"24","author":"YS Han","year":"2013","unstructured":"Han, Y.S., Ko, S.K., Salomaa, K.: The edit-distance between a regular language and a context-free language. Int. J. Found. Comput. Sci. 24(7), 1067\u20131082 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR15","unstructured":"Hazel, P.: pcre2pattern man page, https:\/\/www.pcre.org\/current\/doc\/html\/pcre2pattern.html. Accessed 23 Feb 2023"},{"issue":"8","key":"6_CR16","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phy. Doklady 10(8), 707\u2013710 (1966)","journal-title":"Soviet Phy. Doklady"},{"key":"6_CR17","unstructured":"Microsoft and other contributors: Regular expression language\u2013quick reference (2022). https:\/\/learn.microsoft.com\/en-us\/dotnet\/standard\/base-types\/regular-expression-language-quick-reference. Accessed 25 Feb 2023"},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata: General definitions and algorithms. Int. J. Found. Comput. Sci. 14(6), 957\u2013982 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1142\/S0129054118400099","volume":"29","author":"T Ng","year":"2018","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of neighborhoods and approximate patern matching. Int. J. Found. Comput. Sci. 29(2), 315\u2013329 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.tcs.2019.03.005","volume":"777","author":"A Okhotin","year":"2019","unstructured":"Okhotin, A., Salomaa, K.: Edit distance neighborhoods of input-driven pushdown automata. Theoret. Comput. Sci. 777, 417\u2013430 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1142\/S0129054107005443","volume":"18","author":"K Salomaa","year":"2007","unstructured":"Salomaa, K., Schofield, P.: State complexity of additive weighted finite automata. Int. J. Found. Comput. Sci. 18(6), 1407\u20131416 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Shar, L.K., Tan, H.B.K.: Mining input sanitization patterns for predicting sql injection and cross site scripting vulnerabilities. In: Proceedings of the 34th International Conference on Software Engineering (ICSE), pp. 1293\u20131296 (2012)","DOI":"10.1109\/ICSE.2012.6227096"},{"key":"6_CR23","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":"6_CR24","volume-title":"Theory of Computation","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. Harper & Row, NY, USA (1987)"}],"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-33264-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:04:38Z","timestamp":1684397078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_6","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":"19 May 2023","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":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"19","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":"59% - 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":"6","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)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}