{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:10:33Z","timestamp":1764843033759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343254"},{"type":"electronic","value":"9783031343261"}],"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-34326-1_6","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:04:23Z","timestamp":1687604663000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Operational Complexity: NFA-to-DFA Trade-Off"],"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-4822-230X","authenticated-orcid":false,"given":"Jozef","family":"Jir\u00e1sek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9817-8197","authenticated-orcid":false,"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6501-1096","authenticated-orcid":false,"given":"Juraj","family":"\u0160ebej","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Berglund, M., Bj\u00f6rklund, H., Drewes, F., van der Merwe, B., Watson, B.W.: Cuts in regular expressions. In: B\u00e9al, M., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 70\u201381. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_8","DOI":"10.1007\/978-3-642-38771-5_8"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1\/2), 71\u201389 (2010). https:\/\/doi.org\/10.25596\/jalc-2010-071","DOI":"10.25596\/jalc-2010-071"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s00224-017-9803-8","volume":"62","author":"JA Brzozowski","year":"2017","unstructured":"Brzozowski, J.A., Szyku\u0142a, M., Ye, Y.: Syntactic complexity of regular ideals. Theory Comput. Syst. 62(5), 1175\u20131202 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9803-8","journal-title":"Theory Comput. Syst."},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7(3), 303\u2013310 (2002). https:\/\/doi.org\/10.25596\/jalc-2002-303","DOI":"10.25596\/jalc-2002-303"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Caron, P., Hamel-De le Court, E., Luque, J.G., Patrou, B.: New tools for state complexity. Discret. Math. Theor. Comput. Sci. 22(1) (2020). https:\/\/doi.org\/10.23638\/DMTCS-22-1-9","DOI":"10.23638\/DMTCS-22-1-9"},{"issue":"1\u20132","key":"6_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.3233\/FI-2017-1577","volume":"155","author":"F Drewes","year":"2017","unstructured":"Drewes, F., Holzer, M., Jakobi, S., van der Merwe, B.: Tight bounds for cut-operations on deterministic finite automata. Fundam. Inform. 155(1\u20132), 89\u2013110 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1577","journal-title":"Fundam. Inform."},{"key":"6_CR7","doi-asserted-by":"publisher","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 (2019). https:\/\/doi.org\/10.1007\/978-3-030-13435-8_14","DOI":"10.1007\/978-3-030-13435-8_14"},{"issue":"6","key":"6_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":"6_CR9","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Addison-Wesley, Languages and Computation (1979)"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Hospod\u00e1r, M., Olej\u00e1r, V.: The cut operation in subclasses of convex languages (extended abstract). In: Caron, P., Mignot, L. (eds.) CIAA 2022. LNCS, vol. 13266, pp. 152\u2013164. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07469-1_12","DOI":"10.1007\/978-3-031-07469-1_12"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Jir\u00e1sek, J.\u0160., Jir\u00e1skov\u00e1, G., Szabari, A.: Operations on self-verifying finite automata. In: Beklemishev, L.D., Musatov, D.V. (eds.) CSR 2015. LNCS, vol. 9139, pp. 231\u2013261. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-20297-6_16","DOI":"10.1007\/978-3-319-20297-6_16"},{"issue":"5","key":"6_CR12","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1142\/S012905411842008X","volume":"29","author":"J Jir\u00e1sek Jr","year":"2018","unstructured":"Jir\u00e1sek, J., Jr., Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Operations on unambiguous finite automata. Int. J. Found. Comput. Sci. 29(5), 861\u2013876 (2018). https:\/\/doi.org\/10.1142\/S012905411842008X","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Jir\u00e1skov\u00e1, G., Kraj\u0148\u00e1kov\u00e1, I.: NFA-to-DFA trade-off for regular operations. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 184\u2013196. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_14","DOI":"10.1007\/978-3-030-23247-4_14"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ic.2016.12.007","volume":"253","author":"G Jir\u00e1skov\u00e1","year":"2017","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of operations on two-way finite automata. Inf. Comput. 253, 36\u201363 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.12.007","journal-title":"Inf. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.05.008","volume":"449","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Reversal of binary regular languages. Theoret. Comput. Sci. 449, 85\u201392 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.008","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR16","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Doklady 11, 1373\u20131375 (1970)","journal-title":"Soviet Math. Doklady"},{"key":"6_CR17","unstructured":"Myhill, J.: Finite automata and representation of events. Wright Air Development Center Technical Report, pp. 57\u2013624 (1957)"},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.06.011","volume":"98","author":"N Rampersad","year":"2006","unstructured":"Rampersad, N.: The state complexity of $${L}^2$$ and $${L}^k$$. Inf. Process. Lett. 98(6), 231\u2013234 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2005.06.011","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"6_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. Theor. Comput. Sci. 383(2\u20133), 140\u2013152 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.04.015","journal-title":"Theor. Comput. Sci."},{"key":"6_CR20","unstructured":"Sipser, M.: Introduction to the theory of computation. Cengage Learning (2012)"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1: Word, Language, Grammar, pp. 41\u2013110. Springer (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_2","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315\u2013328 (1994). https:\/\/doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theor. Comput. Sci."}],"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-34326-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:05:20Z","timestamp":1687604720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34326-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343254","9783031343261"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34326-1_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":"24 June 2023","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":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.uni-potsdam.de\/dcfs2023\/","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":"16","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":"88% - 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.35","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)"}}]}}