{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:57:50Z","timestamp":1764842270376,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_14","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"184-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["NFA-to-DFA Trade-Off for Regular Operations"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Kraj\u0148\u00e1kov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"issue":"4","key":"14_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":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(96)00044-0","volume":"58","author":"J Birget","year":"1996","unstructured":"Birget, J.: The state complexity of $$\\overline{\\Sigma ^*\\overline{L}}$$ and its connection with temporal logic. Inf. Process. Lett. 58(4), 185\u2013188 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00044-0","journal-title":"Inf. Process. Lett."},{"issue":"1\/2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.25596\/jalc-2010-071","volume":"15","author":"JA Brzozowski","year":"2010","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","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.25596\/jalc-2002-303","volume":"7","author":"C C\u00e2mpeanu","year":"2002","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","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47(3), 149\u2013158 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90142-8","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"14_CR6","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."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1142\/S0129054119400069","volume":"30","author":"M Hospod\u00e1r","year":"2019","unstructured":"Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Mlyn\u00e1r\u010dik, P.: Descriptional complexity of the forever operator. Int. J. Found. Comput. Sci. 30(1), 115\u2013134 (2019). https:\/\/doi.org\/10.1142\/S0129054119400069","journal-title":"Int. J. Found. Comput. Sci."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-20297-6_16","volume-title":"Computer Science \u2013 Theory and Applications","author":"J\u0160 Jir\u00e1sek","year":"2015","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20297-6_16"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1142\/S012905411842008X","volume":"29","author":"J Jir\u00e1sek Jr","year":"2018","unstructured":"Jir\u00e1sek Jr., J., 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."},{"issue":"2","key":"14_CR10","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":"5","key":"14_CR11","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Sov. Math. Dokl. 11(5), 1373\u20131375 (1970)","journal-title":"Sov. Math. Dokl."},{"issue":"2\u20133","key":"14_CR12","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":"14_CR13","unstructured":"\u0160ebej, J.: Reversal of regular languages and state complexity. In: Pardubsk\u00e1, D. (ed.) Proceedings of the Conference on Theory and Practice of Information Technologies, ITAT 2010. CEUR Workshop Proceedings, vol. 683, pp. 47\u201354. CEUR-WS.org (2010). http:\/\/ceur-ws.org\/Vol-683\/paper8.pdf"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41\u2013110. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_2"},{"issue":"2","key":"14_CR15","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-030-23247-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:51Z","timestamp":1739343051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","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":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","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":"25","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":"18","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":"72% - 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,1","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,9","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)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}