{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:46:33Z","timestamp":1743068793915,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_12","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"142-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizaveta","family":"Sazhneva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"12_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"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J-C Birget","year":"1993","unstructured":"Birget, J.-C.: Partial orders on words, minimal elements of regular languages and state complexity. Theor. Comput. Sci. 119, 267\u2013291 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90160-U","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"12_CR3","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. Univ. Comput. Sci. 16(5), 653\u2013675 (2010). https:\/\/doi.org\/10.3217\/jucs-016-05-0653","journal-title":"J. Univ. Comput. Sci."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1112\/jlms\/s1-43.1.21","volume":"s1\u201343","author":"H Davenport","year":"1968","unstructured":"Davenport, H.: Bases for finite fields. J. London Math. Soc. s1\u201343(1), 21\u201339 (1968)","journal-title":"J. London Math. Soc."},{"issue":"213","key":"12_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1090\/S0025-5718-96-00663-1","volume":"65","author":"W-B Han","year":"1996","unstructured":"Han, W.-B.: The coefficients of primitive polynomials over finite fields. Math. Comput. 65(213), 331\u2013340 (1996). http:\/\/www.jstor.org\/stable\/2153850","journal-title":"Math. Comput."},{"key":"12_CR6","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, 287\u2013298 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.04.011","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR7","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 Informatique Th\u00e9orique et Appl. 42(2), 335\u2013360 (2008). https:\/\/doi.org\/10.1051\/ita:2007038","journal-title":"RAIRO Informatique Th\u00e9orique et Appl."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2019.04.008","volume":"798","author":"G Jir\u00e1skov\u00e1","year":"2019","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: State complexity of unambiguous operations on deterministic finite automata. Theor. Comput. Sci. 798, 52\u201364 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.04.008","journal-title":"Theor. Comput. Sci."},{"key":"12_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769","volume-title":"Introduction to Finite Fields and their Applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/CBO9781139172769"},{"key":"12_CR10","unstructured":"Makarov, V.: Bounded languages described by GF(2)-grammars. CoRR abs\/1912.13401 https:\/\/arxiv.org\/abs\/1912.13401 (2019)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-10801-4_25","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"V Makarov","year":"2019","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"},{"key":"12_CR12","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, 1373\u20131375 (1970)","journal-title":"Sov. Math. Dokl."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-23247-4_19","volume-title":"Descriptional Complexity of Formal Systems","author":"Alexander Okhotin","year":"2019","unstructured":"Okhotin, Alexander, Sazhneva, Elizaveta: State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages. In: Hospod\u00e1r, Michal, Jir\u00e1skov\u00e1, Galina, Konstantinidis, Stavros (eds.) DCFS 2019. LNCS, vol. 11612, pp. 248\u2013259. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23247-4_19"},{"key":"12_CR14","unstructured":"Okhotin, A., Sazhneva, E.: State complexity of GF(2)-operations on unary languages, submitted"},{"key":"12_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 complexity of some basic operations on regular languages. Theor. Comput. Sci. 125, 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-62536-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:51Z","timestamp":1741634571000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}