{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:58Z","timestamp":1760202778316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_21","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"256-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A General Approach to State Complexity of Operations: Formalization and Limitations"],"prefix":"10.1007","author":[{"given":"Sylvie","family":"Davies","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"issue":"06","key":"21_CR1","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1142\/S0129054113400133","volume":"24","author":"JA Brzozowski","year":"2013","unstructured":"Brzozowski, J.A.: In search of most complex regular languages. Int. J. Found. Comput. Sci. 24(06), 691\u2013708 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-41114-9_6","volume-title":"Descriptional Complexity of Formal Systems","author":"J Brzozowski","year":"2016","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Liu, B., Rajasekaran, A., Szyku\u0142a, M.: On the state complexity of the shuffle of regular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 73\u201386. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-41114-9_6"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.04.017","volume":"610","author":"DJ Cho","year":"2016","unstructured":"Cho, D.J., Han, Y.S., Ko, S.K., Salomaa, K.: State complexity of inversion operations. Theor. Comput. Sci. 610, 2\u201312 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR4","unstructured":"Davies, S.: A general approach to state complexity of operations: formalization and limitations. CoRR abs\/1806.08476 (2018). \n                    https:\/\/arxiv.org\/abs\/1806.08476"},{"issue":"4","key":"21_CR5","first-page":"455","volume":"7","author":"M Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity of proportional removals. J. Autom. Lang. Comb. 7(4), 455\u2013468 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2004.02.031","volume":"320","author":"M Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Deletion along trajectories. Theor. Comput. Sci. 320(2), 293\u2013313 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR7","first-page":"469","volume":"7","author":"M Domaratzki","year":"2002","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. J. Autom. Lang. Comb. 7(4), 469\u2013486 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"24","key":"21_CR8","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. Theor. Comput. Sci. 410(24), 2377\u20132392 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR9","first-page":"217","volume":"9","author":"M Domaratzki","year":"2004","unstructured":"Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. J. Autom. Lang. Comb. 9, 217\u2013232 (2004)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00236-015-0245-y","volume":"53","author":"YS Han","year":"2016","unstructured":"Han, Y.S., Ko, S.K., Salomaa, K.: State complexity of deletion and bipolar deletion. Acta Informatica 53(1), 67\u201385 (2016)","journal-title":"Acta Informatica"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-31653-1_34","volume-title":"Developments in Language Theory","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Shallit, J.: The state complexity of star-complement-star. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 380\u2013391. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31653-1_34"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.05.008","volume":"449","author":"G Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., \u0160ebej, J.: Reversal of binary regular languages. Theor. Comput. Sci. 449, 85\u201392 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR13","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-Theor. Inf. Appl. 42(2), 335\u2013360 (2008)","journal-title":"RAIRO-Theor. Inf. Appl."},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theor. Comput. Sci. 197(1), 1\u201356 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2004.02.032","volume":"320","author":"A Salomaa","year":"2004","unstructured":"Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2), 315\u2013329 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:12:45Z","timestamp":1535915565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}