{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:31Z","timestamp":1759638931294,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"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-07469-1_12","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"152-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Cut Operation in\u00a0Subclasses of\u00a0Convex Languages (Extended Abstract)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1752-544X","authenticated-orcid":false,"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4308-9159","authenticated-orcid":false,"given":"Viktor","family":"Olej\u00e1r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,28]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-38771-5_8","volume-title":"Developments in Language Theory","author":"M Berglund","year":"2013","unstructured":"Berglund, M., Bj\u00f6rklund, H., Drewes, F., van der Merwe, B., Watson, B.: Cuts in regular expressions. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 70\u201381. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_8"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.4204\/eptcs.151.7","volume":"151","author":"M Berglund","year":"2014","unstructured":"Berglund, M., Drewes, F., van der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. Electron. Proc. Theor. Comput. Sci. 151, 109\u2013123 (2014). https:\/\/doi.org\/10.4204\/eptcs.151.7","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Li, B., Smith, J.: Quotient complexity of bifix-, factor-, and subword-free regular languages. Acta Cybern. 21(4), 507\u2013527 (2014). https:\/\/doi.org\/10.14232\/actacyb.21.4.2014.1","DOI":"10.14232\/actacyb.21.4.2014.1"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","volume":"470","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Li, B.: Quotient complexity of ideal languages. Theor. Comput. Sci. 470, 36\u201352 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.055","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"J Brzozowski","year":"2013","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theor. Comput. Syst. 54(2), 277\u2013292 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9515-7","journal-title":"Theor. Comput. Syst."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-25929-6_9","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"R Cmorik","year":"2012","unstructured":"Cmorik, R., Jir\u00e1skov\u00e1, G.: Basic operations on binary suffix-free languages. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol. 7119, pp. 94\u2013102. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25929-6_9"},{"key":"12_CR7","unstructured":"Cox, R.: Regular expression matching in the wild, January 2007. https:\/\/swtch.com\/~rsc\/regexp\/regexp3.html. Accessed 21 Feb 2022"},{"key":"12_CR8","unstructured":"Cox, R.: Re2: A principled approach to regular expression matching, March 2010. https:\/\/opensource.googleblog.com\/2010\/03\/re2-principled-approach-to-regular.html. Accessed 21 Feb 2022"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Drewes, F., Holzer, M., Jakobi, S., van\u00a0der Merwe, B.: Tight bounds for cut-operations on deterministic finite automata. Fundam. Inform. 155(1-2), 89\u2013110 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1577, Preliminary version in: MCU 2015. LNCS, vol. 9288, pp. 45\u201360. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23111-2_4","DOI":"10.3233\/FI-2017-1577 10.1007\/978-3-319-23111-2_4"},{"key":"12_CR10","unstructured":"Friedl, J.E.: Mastering Regular Expressions. O\u2019Reilly Media, Inc., Newton (2006)"},{"issue":"27\u201329","key":"12_CR11","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"YS Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27\u201329), 2537\u20132548 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.12.054","journal-title":"Theor. Comput. Sci."},{"key":"12_CR12","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Automata, Formal Languages, and Related Topics, pp. 99\u2013115. University of Szeged, Hungary (2009)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-13435-8_14","volume-title":"Language and Automata Theory and Applications","author":"M Holzer","year":"2019","unstructured":"Holzer, M., Hospod\u00e1r, M.: The range of state complexities of languages resulting from the cut operation. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) LATA 2019. LNCS, vol. 11417, pp. 190\u2013202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_14"},{"key":"12_CR14","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"issue":"9","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952). https:\/\/doi.org\/10.1109\/JRPROC.1952.273898","journal-title":"Proc. IRE"},{"key":"12_CR16","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)"}],"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-07469-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:06:21Z","timestamp":1655766381000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_12","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":"28 May 2022","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":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 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":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","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":"26","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":"16","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":"3","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":"62% - 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.8","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)"}}]}}