{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:56:08Z","timestamp":1769921768931,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030485153","type":"print"},{"value":"9783030485160","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48516-0_10","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"122-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Operations on Permutation Automata"],"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":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-12200-2_21","volume-title":"LATIN 2010: Theoretical Informatics","author":"F Bassino","year":"2010","unstructured":"Bassino, F., Giambruno, L., Nicaud, C.: Complexity of operations on cofinite languages. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 222\u2013233. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12200-2_21"},{"key":"10_CR2","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-38771-5_8"},{"key":"10_CR3","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). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.10.055","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54(2), 277\u2013292 (2014). \nhttps:\/\/doi.org\/10.1007\/s00224-013-9515-7","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1142\/S0129054112400515","volume":"23","author":"JA Brzozowski","year":"2012","unstructured":"Brzozowski, J.A., Liu, B.: Quotient complexity of star-free languages. Int. J. Found. Comput. Sci. 23(6), 1261\u20131276 (2012). \nhttps:\/\/doi.org\/10.1142\/S0129054112400515","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, pp. 60\u201370. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45526-4_6"},{"issue":"1\u20132","key":"10_CR7","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. Fund. Inform. 155(1\u20132), 89\u2013110 (2017). \nhttps:\/\/doi.org\/10.3233\/FI-2017-1577","journal-title":"Fund. Inform."},{"issue":"27\u201329","key":"10_CR8","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). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2008.12.054","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","unstructured":"Han, Y., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Leung, H., Pighizzini, G. (eds.) DCFS 2006, pp. 165\u2013176. New Mexico State University, Las Cruces (2006)"},{"key":"10_CR10","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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-13435-8_14"},{"key":"10_CR11","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":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-23247-4_14","volume-title":"Descriptional Complexity of Formal Systems","author":"G Jir\u00e1skov\u00e1","year":"2019","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, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-23247-4_14"},{"issue":"7","key":"10_CR13","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(7), 1639\u20131653 (2011). \nhttps:\/\/doi.org\/10.1142\/S0129054111008933","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1051\/ita:2007038","volume":"42","author":"G Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: State complexity of cyclic shift. RAIRO Theor. Inf. Appl. 42(2), 335\u2013360 (2008). \nhttps:\/\/doi.org\/10.1051\/ita:2007038","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"10_CR15","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":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C Nicaud","year":"1999","unstructured":"Nicaud, C.: Average state complexity of operations on unary automata. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 231\u2013240. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48340-3_21"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1051\/ita\/2016024","volume":"50","author":"M Palmovsk\u00fd","year":"2016","unstructured":"Palmovsk\u00fd, M.: Kleene closure and state complexity. RAIRO Theor. Inform. Appl. 50(3), 251\u2013261 (2016). \nhttps:\/\/doi.org\/10.1051\/ita\/2016024","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. Int. J. Found. Comput. Sci. 13(1), 145\u2013159 (2002). \nhttps:\/\/doi.org\/10.1142\/S012905410200100X","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR19","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, 114\u2013125 (1959). \nhttps:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"issue":"6","key":"10_CR20","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). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2005.06.011","journal-title":"Inf. Process. Lett."},{"key":"10_CR21","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)"},{"issue":"1","key":"10_CR22","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(1), 83\u201390 (1968). \nhttps:\/\/doi.org\/10.1007\/BF01691347","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"10_CR23","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). \nhttps:\/\/doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:03:21Z","timestamp":1590451401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","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":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","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":"38","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":"24","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":"63% - 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.7","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":"1.48","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":"Conference cancelled due to the COVID-19 pandemic","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}