{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:54Z","timestamp":1725584154727},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"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-21254-3_39","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T09:38:04Z","timestamp":1306489084000},"page":"489-498","source":"Crossref","is-referenced-by-count":5,"title":["Undecidability of the State Complexity of Composed Regular Operations"],"prefix":"10.1007","author":[{"given":"Arto","family":"Salomaa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"35","key":"39_CR1","doi-asserted-by":"publisher","first-page":"3272","DOI":"10.1016\/j.tcs.2009.03.026","volume":"410","author":"Z. \u00c9sik","year":"2009","unstructured":"\u00c9sik, Z., Gao, Y., Liu, G., Yu, S.: Estimation of state complexity of combined operations. Theor. Comput. Sci.\u00a0410(35), 3272\u20133280 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR2","unstructured":"Gao, Y., Salomaa, K., Yu, S.: State complexity of catenation and reversal combined with star. In: Descriptional Complexity of Formal Systems (DCFS 2006), pp. 153\u2013164 (2006)"},{"key":"39_CR3","volume-title":"Cornerstones of undecidability","author":"G. Rozenberg","year":"1994","unstructured":"Rozenberg, G., Salomaa, A.: Cornerstones of undecidability. Prentice Hall, New York (1994)"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"39_CR4","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a01-3. Springer, Heidelberg (1997)"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","volume":"383","author":"A. Salomaa","year":"2007","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State complexity of combined operations. TCS: Theoretical Computer Science\u00a0383, 140\u2013152 (2007)","journal-title":"TCS: Theoretical Computer Science"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"293","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. TCS: Theoretical Computer Science\u00a0320, 293\u2013313 (2004)","journal-title":"TCS: Theoretical Computer Science"},{"issue":"4","key":"39_CR7","first-page":"683","volume":"18","author":"K. Salomaa","year":"2007","unstructured":"Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. IJFCS: International Journal of Foundations of Computer Science\u00a018(4), 683\u2013698 (2007)","journal-title":"IJFCS: International Journal of Foundations of Computer Science"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11812128_3","volume-title":"Implementation and Application of Automata","author":"S. Yu","year":"2006","unstructured":"Yu, S.: On the state complexity of combined operations. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 11\u201322. Springer, Heidelberg (2006)"},{"key":"39_CR9","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 complexities of some basic operations on regular languages. TCS: Theoretical Computer Science\u00a0125, 315\u2013328 (1994)","journal-title":"TCS: Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21254-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T12:31:11Z","timestamp":1538829071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}