{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:28:04Z","timestamp":1777508884785,"version":"3.51.4"},"reference-count":24,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1051\/ita:2007038","type":"journal-article","created":{"date-parts":[[2007,12,12]],"date-time":"2007-12-12T09:45:16Z","timestamp":1197452716000},"page":"335-360","source":"Crossref","is-referenced-by-count":31,"title":["State complexity of cyclic shift"],"prefix":"10.1051","volume":"42","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,12,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, J.D. Ullman and M. Yannakakis, On notions of information transfer in VLSI circuits, inProceedings of 15th ACM STOC, ACM (1983) 133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"R2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"Birget","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"R3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"Birget","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(96)00044-0","volume":"58","author":"Birget","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"R5","first-page":"303","volume":"7","author":"C\u00e2mpeanu","year":"2002","journal-title":"J. Autom. Lang. Comb."},{"key":"R6","first-page":"455","volume":"7","author":"Domaratzki","year":"2002","journal-title":"J. Autom. Lang. Comb."},{"key":"R7","first-page":"469","volume":"7","author":"Domaratzki","year":"2002","journal-title":"J. Autom. Lang. Comb."},{"key":"R8","first-page":"312","volume":"4162","author":"Geffert","year":"2006","journal-title":"Lect. Notes Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"Glaister","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"Holzer","year":"2003","journal-title":"Int. J. Found. Comput. Sci."},{"key":"R11","unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)."},{"key":"R12","unstructured":"M. Hricko, G. Jir\u00e1skov\u00e1 and A. Szabari, Union and intersection of regular languages and descriptional complexity, inProceedings of DCFS 2005, Como, Italy, June 30\u2013July 2, 2005, 170\u2013181."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d,Communication Complexity and Parallel Computing. Springer-Verlag, Berlin, Heidelberg (1997).","DOI":"10.1007\/978-3-662-03442-2"},{"key":"R14","first-page":"519","volume":"7","author":"Hromkovi\u010d","year":"2002","journal-title":"J. Autom. Lang. Comb."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"K. Iwama, A. Matsuura and M. Paterson, A family of NFAs which need2n- \u03b1deterministic states.Theor. Comput. Sci.301(2003), 451\u2013462.","DOI":"10.1016\/S0304-3975(02)00891-5"},{"key":"R16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"Jir\u00e1skov\u00e1","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"R17","first-page":"1373","volume":"11","author":"Maslov","year":"1970","journal-title":"Soviet Mathematics Doklady"},{"key":"R18","first-page":"333","volume":"9","author":"Maslov","year":"1973","journal-title":"Probl. Inf. Transm."},{"key":"R19","first-page":"119","volume":"55D","author":"Oshiba","year":"1972","journal-title":"T. IECE"},{"key":"R20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"Salomaa","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"R21","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"Salomaa","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"R22","first-page":"471","volume":"64","author":"State","year":"2005","journal-title":"Fund. Inform."},{"key":"R23","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"Yu","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1142\/S0129054105003455","volume":"16","author":"van Zijl","year":"2005","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007038\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T18:00:58Z","timestamp":1557079258000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,13]]},"references-count":24,"journal-issue":{"issue":"2"},"alternative-id":["ita06068"],"URL":"https:\/\/doi.org\/10.1051\/ita:2007038","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,13]]}}}