{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:56:28Z","timestamp":1743022588116,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642225994"},{"type":"electronic","value":"9783642226007"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22600-7_18","type":"book-chapter","created":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T20:58:15Z","timestamp":1311109095000},"page":"222-234","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet"],"prefix":"10.1007","author":[{"given":"Michal","family":"Kunc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","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. Theoretical Computer Science\u00a047, 149\u2013158 (1986); Errata 302, 497\u2013498 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"24-25","key":"18_CR2","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. Theoretical Computer Science\u00a0410(24-25), 2377\u20132392 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"18_CR3","first-page":"226","volume":"33","author":"R.E. Dressler","year":"1972","unstructured":"Dressler, R.E.: A stronger Bertrand\u2019s postulate with an application to partitions. Proceedings of the AMS\u00a033(2), 226\u2013228 (1972)","journal-title":"Proceedings of the AMS"},{"issue":"8","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.ic.2007.01.008","volume":"205","author":"V. Geffert","year":"2007","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Information and Computation\u00a0205(8), 1173\u20131187 (2007)","journal-title":"Information and Computation"},{"key":"18_CR5","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. International Journal of Foundations of Computer Science\u00a014, 1087\u20131102 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-85780-8_35","volume-title":"Developments in Language Theory","author":"G. Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of operations on two-way finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 443\u2013454. Springer, Heidelberg (2008)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/SFCS.1997.646094","volume-title":"38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","author":"A. Kondacs","year":"1997","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), Miami Beach, Florida, USA, October 19-22, pp. 66\u201375. IEEE, Los Alamitos (199719-22)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-642-22321-1_28","volume-title":"DLT 2011","author":"M. Kunc","year":"2011","unstructured":"Kunc, M., Okhotin, A.: Describing periodicity in two-way deterministic finite automata using transformation semigroups. In: Leporati, A. (ed.) DLT 2011. LNCS, vol.\u00a06795, pp. 324\u2013336. Springer, Heidelberg (2011)"},{"key":"18_CR9","unstructured":"Kunc, M., Okhotin, A.: Reversible two-way finite automata over a unary alphabet (manuscript in preparation)"},{"issue":"5","key":"18_CR10","first-page":"92","volume":"3","author":"E. Landau","year":"1903","unstructured":"Landau, E.: \u00dcber die Maximalordnung der Permutationen gegebenen Grades (On the maximal order of permutations of a given degree). Archiv der Mathematik und Physik, Ser.\u00a03(5), 92\u2013103 (1903)","journal-title":"Archiv der Mathematik und Physik, Ser."},{"key":"18_CR11","first-page":"1373","volume":"11","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Mathematics Doklady"},{"issue":"6","key":"18_CR12","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2322839","volume":"94","author":"W. Miller","year":"1987","unstructured":"Miller, W.: The maximum order of an element of a finite symmetric group. American Mathematical Monthly\u00a094(6), 497\u2013506 (1987)","journal-title":"American Mathematical Monthly"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-642-15155-2_49","volume-title":"Mathematical Foundations of Computer Science 2010","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: Unambiguous finite automata over a unary alphabet. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 556\u2013567. Springer, Heidelberg (2010)"},{"issue":"1","key":"18_CR14","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. International Journal of Foundations of Computer Science\u00a013(1), 145\u2013159 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR15","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\n                  2 and L\n                  \n                    k\n                  . Information Processing Letters\u00a098, 231\u2013234 (2006)","journal-title":"Information Processing Letters"},{"key":"18_CR16","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. Theoretical Computer Science\u00a0125, 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22600-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T08:33:22Z","timestamp":1553934802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22600-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642225994","9783642226007"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22600-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}