{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:11Z","timestamp":1725728351018},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_22","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"246-257","source":"Crossref","is-referenced-by-count":6,"title":["Cyclic Shift on Prefix-Free Languages"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.-C. Birget","year":"1992","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inform. Process. Letters\u00a043, 185\u2013190 (1992)","journal-title":"Inform. Process. Letters"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.tcs.2009.04.009","volume":"410","author":"H. Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. Theoret. Comput. Sci.\u00a0410, 3281\u20133289 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR3","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99\u2013115. University of Szeged, Hungary (2009)"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform.\u00a090, 93\u2013106 (2009)","journal-title":"Fund. Inform."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-00982-2_34","volume-title":"Language and Automata Theory and Applications","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Yu, S.: State complexity of combined operations for prefix-free regular languages. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 398\u2013409. Springer, Heidelberg (2009)"},{"key":"22_CR6","first-page":"236","volume-title":"Proc. 12th DCFS","author":"G. Jir\u00e1skov\u00e1","year":"2010","unstructured":"Jir\u00e1skov\u00e1, G., Krausov\u00e1, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) Proc. 12th DCFS, pp. 236\u2013244. University of Saskatchewan, Saskatoon (2010)"},{"key":"22_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. Theor. Inform. Appl.\u00a042, 335\u2013360 (2008)","journal-title":"Theor. Inform. Appl."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-25929-6_11","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"M. Krausov\u00e1","year":"2012","unstructured":"Krausov\u00e1, M.: Prefix-free regular languages: Closure properties, difference, and left quotient. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol.\u00a07119, pp. 114\u2013122. Springer, Heidelberg (2012)"},{"key":"22_CR9","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 Math. Dokl.\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"22_CR10","first-page":"81","volume":"9","author":"A.N. Maslov","year":"1973","unstructured":"Maslov, A.N.: The cyclic shift of languages. Problemy Pereda\u010di Informacii\u00a09, 81\u201387 (1973) (Russian)","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"22_CR11","first-page":"119","volume":"55","author":"T. Oshiba","year":"1972","unstructured":"Oshiba, T.: Closure property of the family of context-free languages under the cyclic shift operation. Electron. Commun. Japan\u00a055, 119\u2013122 (1972)","journal-title":"Electron. Commun. Japan"},{"key":"22_CR12","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"key":"22_CR13","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, vol.\u00a0I, ch. 2, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"key":"22_CR14","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. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T15:09:12Z","timestamp":1595862552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}