{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:41Z","timestamp":1759637921306,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031132568"},{"type":"electronic","value":"9783031132575"}],"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-13257-5_9","type":"book-chapter","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:02:52Z","timestamp":1661122972000},"page":"112-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Operations on\u00a0Subregular Languages and\u00a0Nondeterministic State Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1752-544X","authenticated-orcid":false,"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[]},{"given":"Peter","family":"Mlyn\u00e1r\u010dik","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4308-9159","authenticated-orcid":false,"given":"Viktor","family":"Olej\u00e1r","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J Birget","year":"1992","unstructured":"Birget, J.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185\u2013190 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90198-5","journal-title":"Inf. Process. Lett."},{"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":"3","key":"9_CR3","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"},{"issue":"24\u201325","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2377","DOI":"10.1016\/j.tcs.2009.02.025","volume":"410","author":"M Domaratzki","year":"2009","unstructured":"Domaratzki, M., Okhotin, A.: State complexity of power. Theor. Comput. Sci. 410(24\u201325), 2377\u20132392 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.02.025","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.4204\/eptcs.31.21","volume":"31","author":"YS Han","year":"2010","unstructured":"Han, Y.S., Salomaa, K.: Nondeterministic state complexity for suffix-free regular languages. Electron. Proc. Theor. Comput. Sci. 31, 189\u2013196 (2010). https:\/\/doi.org\/10.4204\/eptcs.31.21","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"YS Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform. 90, 93\u2013106 (2009). https:\/\/doi.org\/10.3233\/FI-2009-0008","journal-title":"Fundam. Inform."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-62536-8_6","volume-title":"Descriptional Complexity of Formal Systems","author":"S Hoffmann","year":"2020","unstructured":"Hoffmann, S.: State complexity bounds for the commutative closure of group languages. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 64\u201377. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_6"},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14(6), 1087\u20131102 (2003). https:\/\/doi.org\/10.1142\/S0129054103002199","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR9","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_CR10","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_CR11","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."},{"key":"9_CR12","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."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330(2), 287\u2013298 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.04.011","journal-title":"Theor. Comput. Sci."},{"issue":"07","key":"9_CR14","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_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"9_CR16","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_CR17","first-page":"9","volume":"5","author":"HJ Shyr","year":"1974","unstructured":"Shyr, H.J., Thierrin, G.: Ordered automata and associated languages. Tamkang J. Math. 5, 9\u201320 (1974)","journal-title":"Tamkang J. Math."},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF01761710","volume":"8","author":"HJ Shyr","year":"1974","unstructured":"Shyr, H.J., 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"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13257-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:03:30Z","timestamp":1661123010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13257-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031132568","9783031132575"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13257-5_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":"22 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","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":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/konferencia.unideb.hu\/en\/dcfs-2022","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":"17","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":"14","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":"82% - 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)"}}]}}