{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:29:53Z","timestamp":1762507793561,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"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_7","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"98-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Square, Power, Positive Closure, and Complementation on Star-Free Languages"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Davies","sequence":"first","affiliation":[]},{"given":"Michal","family":"Hospod\u00e1r","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"issue":"6","key":"7_CR1","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. Internat. J. Found. Comput. Sci. 23(6), 1261\u20131276 (2012). https:\/\/doi.org\/10.1142\/S0129054112400515","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"7","key":"7_CR2","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1142\/S0129054115400067","volume":"26","author":"JA Brzozowski","year":"2015","unstructured":"Brzozowski, J.A., Szykula, M.: Large aperiodic semigroups. Internat. J. Found. Comput. Sci. 26(7), 913\u2013932 (2015). https:\/\/doi.org\/10.1142\/S0129054115400067","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"7_CR3","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). https:\/\/doi.org\/10.1007\/3-540-45526-4_6"},{"issue":"24\u201325","key":"7_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. Theoret. Comput. Sci. 410(24\u201325), 2377\u20132392 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.02.025","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.ic.2007.07.001","volume":"205","author":"V Geffert","year":"2007","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205(11), 1652\u20131670 (2007). https:\/\/doi.org\/10.1016\/j.ic.2007.07.001","journal-title":"Inform. Comput."},{"issue":"6","key":"7_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. Internat. J. Found. Comput. Sci. 14(6), 1087\u20131102 (2003). https:\/\/doi.org\/10.1142\/S0129054103002199","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"7_CR7","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. Theoret. Comput. Sci. 450, 68\u201380 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.028","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR8","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)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1017\/S0013091500026936","volume":"17","author":"JM Howie","year":"1971","unstructured":"Howie, J.M.: Products of idempotents in certain semigroups of transformations. Proc. Edinburgh Math. Soc. 17(3), 223\u2013236 (1971). https:\/\/doi.org\/10.1017\/S0013091500026936","journal-title":"Proc. Edinburgh Math. Soc."},{"issue":"2","key":"7_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. Theoret. Comput. Sci. 330(2), 287\u2013298 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.04.011","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"EL Leiss","year":"1981","unstructured":"Leiss, E.L.: Succint representation of regular languages by boolean automata. Theoret. Comput. Sci. 13, 323\u2013330 (1981). https:\/\/doi.org\/10.1016\/S0304-3975(81)80005-9","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR12","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"},{"issue":"1","key":"7_CR13","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. Internat. J. Found. Comput. Sci. 13(1), 145\u2013159 (2002). https:\/\/doi.org\/10.1142\/S012905410200100X","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"6","key":"7_CR14","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}$$. Inform. Process. Lett. 98(6), 231\u2013234 (2006). https:\/\/doi.org\/10.1016\/j.ipl.2005.06.011","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"7_CR15","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":"7_CR16","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Cengage Learning (2012)"},{"key":"7_CR17","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":"7_CR18","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. Theoret. Comput. Sci. 125(2), 315\u2013328 (1994). https:\/\/doi.org\/10.1016\/0304-3975(92)00011-F","journal-title":"Theoret. 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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:49Z","timestamp":1739343049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_7","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)"}}]}}