{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:54Z","timestamp":1725577434780},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"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-18098-9_11","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"95-104","source":"Crossref","is-referenced-by-count":2,"title":["State Complexity of Catenation Combined with Union and Intersection"],"prefix":"10.1007","author":[{"given":"Bo","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. Campeanu","year":"2001","unstructured":"Campeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite language. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"issue":"24-25","key":"11_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":"35","key":"11_CR3","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. Theoretical Computer Science\u00a0410(35), 3272\u20133280 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"11_CR4","first-page":"75","volume":"83","author":"Y. Gao","year":"2008","unstructured":"Gao, Y., Salomaa, K., Yu, S.: The state complexity of two combined operations: star of catenation and star of Reversal. Fundam. Inform.\u00a083(1-2), 75\u201389 (2008)","journal-title":"Fundam. Inform."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gao, Y., Yu, S.: State complexity approximation. In: Proceedings of Descriptional Complexity of Formal Systems, pp. 163\u2013174 (2009)","DOI":"10.4204\/EPTCS.3.11"},{"issue":"27-29","key":"11_CR6","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y. Han","year":"2009","unstructured":"Han, Y., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Theoretical Computer Science\u00a0410(27-29), 2537\u20132548 (2009)","journal-title":"Theoretical Computer Science"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44977-9_14","volume-title":"Implementation and Application of Automata","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: State complexity of basic operations on nondeterministic finite automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 148\u2013157. Springer, Heidelberg (2003)"},{"key":"11_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (1979)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1142\/S0129054105003133","volume":"16","author":"J. Jir\u00e1sek","year":"2005","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G., Szabari, A.: State complexity of concatenation and complementation of regular languages. International Journal of Foundations of Computer Science\u00a016, 511\u2013529 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2004.04.011","volume":"330","author":"G. Jir\u00e1skov\u00e1","year":"2005","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theoretical Computer Science\u00a0330, 287\u2013298 (2005)","journal-title":"Theoretical Computer Science"},{"key":"11_CR11","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Turku Center for Computer Science TUCS Technical Report No. 825 (2007)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ic.2008.03.018","volume":"206","author":"G. Liu","year":"2008","unstructured":"Liu, G., Martin-Vide, C., Salomaa, A., Yu, S.: State complexity of basic language operations combined with reversal. Information and Computation\u00a0206, 1178\u20131186 (2008)","journal-title":"Information and Computation"},{"key":"11_CR13","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"},{"key":"11_CR14","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. Theoretical Computer Science\u00a0320, 293\u2013313 (2004)","journal-title":"Theoretical Computer Science"},{"key":"11_CR15","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. Theoretical Computer Science\u00a0383, 140\u2013152 (2007)","journal-title":"Theoretical Computer Science"},{"key":"11_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"},{"key":"11_CR17","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.\u00a01, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"issue":"2","key":"11_CR18","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. Journal of Automata, Languages and Combinatorics\u00a06(2), 221\u2013234 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T06:14:29Z","timestamp":1553408069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}