{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:29:28Z","timestamp":1747056568671,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402463"},{"type":"electronic","value":"9783031402470"}],"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-40247-0_22","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:02:54Z","timestamp":1691568174000},"page":"290-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Smaller Representation of\u00a0Compiled Regular Expressions"],"prefix":"10.1007","author":[{"given":"Sicheol","family":"Sung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Ki","family":"Ko","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":[[2023,8,10]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-02979-0_10","volume-title":"Implementation and Application of Automata","author":"A Almeida","year":"2009","unstructured":"Almeida, A., Almeida, M., Alves, J., Moreira, N., Reis, R.: FAdo and GUItar. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 65\u201374. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02979-0_10"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Berglund, M., van der Merwe, B.: On the semantics of regular expression parsing in the wild. In: Proceedings of the 20th International Conference on Implementation and Application of Automata, pp. 292\u2013304 (2015)","DOI":"10.1007\/978-3-319-22360-5_24"},{"issue":"4","key":"22_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."},{"issue":"2","key":"22_CR4","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. Theoret. Comput. Sci. 120(2), 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"22_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(97)00296-X","volume":"233","author":"P Caron","year":"2000","unstructured":"Caron, P., Ziadi, D.: Characterization of Glushkov automata. Theoret. Comput. Sci. 233(1\u20132), 75\u201390 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00207160310001650025","volume":"81","author":"J Champarnaud","year":"2004","unstructured":"Champarnaud, J., Coulon, F., Parantho\u00ebn, T.: Compact and fast algorithms for safe regular expression search. Int. J. Comput. Math. 81(4), 383\u2013401 (2004)","journal-title":"Int. J. Comput. Math."},{"issue":"1\u20132","key":"22_CR7","first-page":"1","volume":"178","author":"C Chang","year":"1997","unstructured":"Chang, C., Paige, R.: From regular expressions to DFA\u2019s using compressed NFA\u2019s. Theoret. Comput. Sci. 178(1\u20132), 1\u201336 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR8","unstructured":"Contributors: Compilation and reuse in regular expressions, September 2021. https:\/\/learn.microsoft.com\/en-us\/dotnet\/standard\/base-types\/compilation-and-reuse-in-regular-expressions. Accessed 25 Apr 2023"},{"key":"22_CR9","unstructured":"Cortes, C., Mohri, M.: Learning with weighted transducers. In: Proceedings of the 7th International Workshop on Finite-State Methods and Natural Language Processing, pp. 14\u201322 (2008)"},{"key":"22_CR10","unstructured":"CTRE: Compile time regular expression in C++, January 2023. https:\/\/github.com\/hanickadot\/compile-time-regular-expressions. Accessed 25 Apr 2023"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Daciuk, J.: Experiments with automata compression. In: Proceedings of the 5th International Conference on Implementation and Application of Automata, pp. 105\u2013112 (2001)","DOI":"10.1007\/3-540-44674-5_8"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Daciuk, J., Weiss, D.: Smaller representation of finite state automata. In: Proceedings of the 16th International Conference on Implementation and Application of Automata, pp. 118\u2013129 (2011)","DOI":"10.1007\/978-3-642-22256-6_12"},{"key":"22_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"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Davis, J.C., Moyer, D., Kazerouni, A.M., Lee, D.: Testing regex generalizability and its implications: a large-scale many-language measurement study. In: Proceedings of the 34th IEEE\/ACM International Conference on Automated Software Engineering, pp. 427\u2013439 (2019)","DOI":"10.1109\/ASE.2019.00048"},{"issue":"1\u20133","key":"22_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0166-218X(03)00299-3","volume":"134","author":"D Giammarresi","year":"2004","unstructured":"Giammarresi, D., Ponty, J., Wood, D., Ziadi, D.: A characterization of Thompson digraphs. Discret. Appl. Math. 134(1\u20133), 317\u2013337 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"22_CR16","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(5), 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Hossain, S.: Visualization of bioinformatics data with dash bio. In: Proceedings of the 18th Python in Science Conference, pp. 126\u2013133 (2019)","DOI":"10.25080\/Majora-7ddc1dd1-012"},{"key":"22_CR18","unstructured":"Lin, J., Chen, W.M., Lin, Y., Cohn, J., Gan, C., Han, S.: MCUNet: tiny deep learning on IoT devices. In: Advances in Neural Information Processing System, vol. 33, pp. 11711\u201311722 (2020)"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Luo, B., Lee, D., Lee, W., Liu, P.: QFilter: fine-grained run-time XML access control via NFA-based query rewriting. In: Proceedings of the 13th ACM International Conference on Information and Knowledge Management, pp. 543\u2013552 (2004)","DOI":"10.1145\/1031171.1031273"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. EC-9(1), 39\u201347 (1960)","DOI":"10.1109\/TEC.1960.5221603"},{"key":"22_CR21","unstructured":"Meiners, C.R., Patel, J., Norige, E., Torng, E., Liu, A.X.: Fast regular expression matching using small TCAMs for network intrusion detection and prevention systems. In: Proceedings of 19th USENIX Security Symposium, pp. 111\u2013126 (2010)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-79121-6_4","volume-title":"Implementation and Application of Automata","author":"B van der Merwe","year":"2021","unstructured":"van der Merwe, B., Mouton, J., van Litsenborgh, S., Berglund, M.: Memoized regular expressions. In: Maneth, S. (ed.) CIAA 2021. LNCS, vol. 12803, pp. 39\u201352. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_4"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Seward, J.: Valgrind: a framework for heavyweight dynamic binary instrumentation. In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp. 89\u2013100 (2007)","DOI":"10.1145\/1273442.1250746"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.entcs.2014.01.021","volume":"302","author":"DSN Nunes","year":"2014","unstructured":"Nunes, D.S.N., Ayala-Rinc\u00f3n, M.: A compressed suffix tree based implementation with low peak memory usage. Electron. Notes Theoret. Comput. Sci. 302, 73\u201394 (2014)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"22_CR25","unstructured":"Ramey, R.: November 2004. https:\/\/www.boost.org\/doc\/libs\/1_82_0\/libs\/serialization\/doc\/index.html. Accessed 25 Apr 2023"},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"DR Raymond","year":"1994","unstructured":"Raymond, D.R., Wood, D.: Grail: a C++ library for automata and expressions. J. Symb. Comput. 17(4), 341\u2013350 (1994)","journal-title":"J. Symb. Comput."},{"key":"22_CR27","unstructured":"Rodger, S.H., Finley, T.W.: JFLAP: An Interactive Formal Languages and Automata Package. Jones & Bartlett Learning (2006)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Sung, S., Cheon, H., Han, Y.S.: How to settle the ReDoS problem: back to the classical automata theory. In: Proceedings of the 26th International Conference on Implementation and Application of Automata, pp. 34\u201349 (2022)","DOI":"10.1007\/978-3-031-07469-1_3"},{"issue":"6","key":"22_CR29","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":"22_CR30","unstructured":"Xeger: Xeger (2019). https:\/\/pypi.org\/project\/xeger\/. Accessed 25 Apr 2023"},{"issue":"3","key":"22_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0167-9473(98)00040-1","volume":"28","author":"S Zani","year":"1998","unstructured":"Zani, S., Riani, M., Corbellini, A.: Robust bivariate boxplots and multiple outlier detection. Comput. Stat. Data Anal. 28(3), 257\u2013270 (1998)","journal-title":"Comput. Stat. Data Anal."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40247-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:10:12Z","timestamp":1691568612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40247-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402463","9783031402470"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40247-0_22","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":"10 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Famagusta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa.emu.edu.tr\/en","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"20","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":"67% - 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":"2-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)"}}]}}