{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:18:42Z","timestamp":1769973522323,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030232467","type":"print"},{"value":"9783030232474","type":"electronic"}],"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_19","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"248-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[]},{"given":"Elizaveta","family":"Sazhneva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-77313-1_5","volume-title":"Language and Automata Theory and Applications","author":"E Bakinova","year":"2018","unstructured":"Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A., Sazhneva, E.: Formal languages over GF(2). In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 68\u201379. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_5"},{"issue":"1\/2","key":"19_CR2","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":"19_CR3","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":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.3217\/jucs-016-05-0653","volume":"16","author":"M Daley","year":"2010","unstructured":"Daley, M., Domaratzki, M., Salomaa, K.: Orthogonal concatenation: language equations and state complexity. J. UCS 16(5), 653\u2013675 (2010). https:\/\/doi.org\/10.3217\/jucs-016-05-0653","journal-title":"J. UCS"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","volume":"295","author":"V Geffert","year":"2003","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295, 189\u2013203 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00403-6","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-94631-3_16","volume-title":"Descriptional Complexity of Formal Systems","author":"G Jir\u00e1skov\u00e1","year":"2018","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: State complexity of unambiguous operations on deterministic finite automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 188\u2013199. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94631-3_16"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-22321-1_28","volume-title":"Developments in Language Theory","author":"M Kunc","year":"2011","unstructured":"Kunc, M., Okhotin, A.: Describing periodicity in two-way deterministic finite automata using transformation semigroups. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 324\u2013336. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_28"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Makarov, V., Okhotin, A.: On the expressive power of GF(2)-grammars. In: Catania, B., Kr\u00e1lovi\u010d, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 310\u2013323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10801-4_25","DOI":"10.1007\/978-3-030-10801-4_25"},{"key":"19_CR9","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":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1976","DOI":"10.1137\/S009753979935431X","volume":"30","author":"C Mereghetti","year":"2001","unstructured":"Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput. 30(6), 1976\u20131992 (2001). https:\/\/doi.org\/10.1137\/S009753979935431X","journal-title":"SIAM J. Comput."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ic.2012.01.003","volume":"212","author":"A Okhotin","year":"2012","unstructured":"Okhotin, A.: Unambiguous finite automata over a unary alphabet. Inf. Comput. 212, 15\u201336 (2012). https:\/\/doi.org\/10.1016\/j.ic.2012.01.003","journal-title":"Inf. Comput."},{"issue":"1","key":"19_CR12","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). https:\/\/doi.org\/10.1142\/S012905410200100X","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"19_CR13","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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:39Z","timestamp":1739343039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}