{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T18:26:18Z","timestamp":1770575178152,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031135019","type":"print"},{"value":"9783031135026","type":"electronic"}],"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-13502-6_9","type":"book-chapter","created":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T11:03:54Z","timestamp":1659783834000},"page":"126-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Closure Properties of\u00a0Subregular Languages Under Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4308-9159","authenticated-orcid":false,"given":"Viktor","family":"Olej\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Szabari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,7]]},"reference":[{"key":"9_CR1","unstructured":"Ang, T., Brzozowski, J.A.: Languages convex with respect to binary relations, and their closure properties. Acta Cybern. 19(2), 445\u2013464 (2009). https:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3776"},{"issue":"35","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","volume":"410","author":"H Bordihn","year":"2009","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35), 3209\u20133222 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.05.019","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.14232\/actacyb.21.4.2014.1","volume":"21","author":"J Brzozowski","year":"2014","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","journal-title":"Acta Cybern."},{"key":"9_CR4","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529\u2013561. Polytechnic Press, New York (1962)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1145\/321406.321409","volume":"14","author":"JA Brzozowski","year":"1967","unstructured":"Brzozowski, J.A.: Roots of star events. J. ACM 14(3), 466\u2013477 (1967). https:\/\/doi.org\/10.1145\/321406.321409","journal-title":"J. ACM"},{"key":"9_CR6","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":"9_CR7","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. Theory Comput. Syst. 54(2), 277\u2013292 (2013). https:\/\/doi.org\/10.1007\/s00224-013-9515-7","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/inco.2000.2889","volume":"164","author":"S Crvenkovi\u0107","year":"2001","unstructured":"Crvenkovi\u0107, S., Dolinka, I., \u00c9sik, Z.: On equations for union-free regular languages. Inf. Comput. 164(1), 152\u2013172 (2001). https:\/\/doi.org\/10.1006\/inco.2000.2889","journal-title":"Inf. Comput."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-030-23247-4_7","volume-title":"Descriptional Complexity of Formal Systems","author":"S Davies","year":"2019","unstructured":"Davies, S., Hospod\u00e1r, M.: Square, power, positive closure, and complementation on star-free languages. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 98\u2013110. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_7"},{"issue":"27\u201329","key":"9_CR10","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y Han","year":"2009","unstructured":"Han, Y., 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":"9_CR11","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics - Dedicated to Ferenc G\u00e9cseg on the Occasion of his 70th Birthday","author":"Y Han","year":"2009","unstructured":"Han, Y., 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 - Dedicated to Ferenc G\u00e9cseg on the Occasion of his 70th Birthday, pp. 99\u2013115. Institute of Informatics, University of Szeged, Hungary (2009)"},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2012.04.028","volume":"450","author":"M Holzer","year":"2012","unstructured":"Holzer, M., Kutrib, M., Meckel, K.: Nondeterministic state complexity of star-free languages. Theor. Comput. Sci. 450, 68\u201380 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.028","journal-title":"Theor. Comput. Sci."},{"key":"9_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2021.02.002","volume":"870","author":"M Hospod\u00e1r","year":"2021","unstructured":"Hospod\u00e1r, M.: Power, positive closure, and quotients on convex languages. Theor. Comput. Sci. 870, 53\u201374 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.02.002","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1142\/S0129054120420083","volume":"31","author":"M Hospod\u00e1r","year":"2020","unstructured":"Hospod\u00e1r, M., Holzer, M.: The ranges of accepting state complexities of languages resulting from some operations. Int. J. Found. Comput. Sci. 31(8), 1159\u20131177 (2020). https:\/\/doi.org\/10.1142\/S0129054120420083","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2018.12.027","volume":"787","author":"M Hospod\u00e1r","year":"2019","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787, 89\u2013110 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.12.027","journal-title":"Theor. Comput. Sci."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-48516-0_10","volume-title":"Developments in Language Theory","author":"M Hospod\u00e1r","year":"2020","unstructured":"Hospod\u00e1r, M., Mlyn\u00e1r\u010dik, P.: Operations on permutation automata. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 122\u2013136. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_10"},{"issue":"07","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. Int. J. Found. Comput. Sci. 22(07), 1639\u20131653 (2011). https:\/\/doi.org\/10.1142\/S0129054111008933","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1145\/321510.321513","volume":"16","author":"AR Meyer","year":"1969","unstructured":"Meyer, A.R.: A note on star-free events. J. ACM 16(2), 220\u2013225 (1969). https:\/\/doi.org\/10.1145\/321510.321513","journal-title":"J. ACM"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-23247-4_3","volume-title":"Descriptional Complexity of Formal Systems","author":"B Nagy","year":"2019","unstructured":"Nagy, B.: Union-freeness, deterministic union-freeness and union-complexity. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 46\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_3"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1145\/321281.321292","volume":"12","author":"A Paz","year":"1965","unstructured":"Paz, A., Peleg, B.: Ultimate-definite and symmetric-definite events and automata. J. ACM 12(3), 399\u2013410 (1965). https:\/\/doi.org\/10.1145\/321281.321292","journal-title":"J. ACM"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Perles, M., Rabin, M.O., Shamir, E.: The theory of definite automata. IEEE Trans. Electron. Comput. EC-12(3), 233\u2013243 (1963). https:\/\/doi.org\/10.1109\/PGEC.1963.263534","DOI":"10.1109\/PGEC.1963.263534"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965). https:\/\/doi.org\/10.1016\/S0019-9958(65)90108-7","journal-title":"Inf. Control"},{"key":"9_CR25","first-page":"9","volume":"5","author":"H Shyr","year":"1974","unstructured":"Shyr, H., Thierrin, G.: Ordered automata and associated languages. Tamkang J. Math. 5, 9\u201320 (1974)","journal-title":"Tamkang J. Math."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF01761710","volume":"8","author":"H Shyr","year":"1974","unstructured":"Shyr, H., Thierrin, G.: Power-separating regular languages. Math. Syst. Theory 8(1), 90\u201395 (1974). https:\/\/doi.org\/10.1007\/BF01761710","journal-title":"Math. Syst. Theory"},{"key":"9_CR27","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2012","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01691347","volume":"2","author":"G Thierrin","year":"1968","unstructured":"Thierrin, G.: Permutation automata. Math. Syst. Theory 2, 83\u201390 (1968). https:\/\/doi.org\/10.1007\/BF01691347","journal-title":"Math. Syst. Theory"},{"key":"9_CR29","first-page":"481","volume-title":"ICALP 1972","author":"G Thierrin","year":"1972","unstructured":"Thierrin, G.: Convex languages. In: Nivat, M. (ed.) ICALP 1972, pp. 481\u2013492. North-Holland, Amsterdam (1972)"}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13502-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T23:05:04Z","timestamp":1660777504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13502-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031135019","9783031135026"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13502-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machines, Computations, and Universality","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","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":"31 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcu2022","order":10,"name":"conference_id","label":"Conference ID","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":"18","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":"10","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":"56% - 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.7","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)"}}]}}