{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:08Z","timestamp":1725890348082},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_12","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T01:03:34Z","timestamp":1341795814000},"page":"155-168","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of Star and Square of Union of k Regular Languages"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S0129054112400047","volume":"23","author":"B. Cui","year":"2012","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of two combined operations: catenation-star and catenation-reversal. International Journal of Foundations of Computer Science\u00a023(1), 51\u201356 (2012)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theoretical Computer Science (2011) (accepted)","DOI":"10.1016\/j.tcs.2012.02.030"},{"issue":"8","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1142\/S0129054111009045","volume":"22","author":"B. Cui","year":"2011","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of two combined operations: catenation-union and catenation-intersection. International Journal of Foundations of Computer Science\u00a022(8), 1797\u20131812 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"12_CR4","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. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik, K., Salomaa, K., Yu, S.: State Complexity of Basic Operations on Finite Languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"issue":"3","key":"12_CR5","first-page":"303","volume":"7","author":"C. Campeanu","year":"2002","unstructured":"Campeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. Journal of Automata, Languages and Combinatorics\u00a07(3), 303\u2013310 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"12_CR6","unstructured":"Daley, M., Domaratzki, M., Salomaa, K.: State complexity of orthogonal catenation. In: Proceedings of DCFS 2008, Charlottetown, pp. 134\u2013144 (2008)"},{"issue":"24-25","key":"12_CR7","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":"12_CR8","doi-asserted-by":"publisher","first-page":"3272","DOI":"10.1016\/j.tcs.2009.03.026","volume":"410","author":"Z. \u00c9sik","year":"2008","unstructured":"\u00c9sik, Z., Gao, Y., Liu, G., Yu, S.: Estimation of State Complexity of Combined Operations. Theoretical Computer Science\u00a0410(35), 3272\u20133280 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"12_CR9","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. Fundamenta Informaticae\u00a083(1-2), 75\u201389 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR10","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":"12_CR11","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley (2001)","DOI":"10.1145\/568438.568455"},{"key":"12_CR12","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":"12_CR13","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection, TUCS Technical Report No. 825 (2007)"},{"key":"12_CR14","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":"12_CR15","first-page":"145","volume":"13","author":"G. Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.O.: Unary language operations, state complexity and Jacobsthal\u2019s function. IJFCS\u00a013, 145\u2013159 (2002)","journal-title":"IJFCS"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.06.011","volume":"98","author":"N. Rampersad","year":"2006","unstructured":"Rampersad, N.: The state complexity of L\n                  2 and L\n                  \n                    k\n                  . Information Processing Letters\u00a098, 231\u2013234 (2006)","journal-title":"Information Processing Letters"},{"key":"12_CR18","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":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-21254-3_39","volume-title":"Language and Automata Theory and Applications","author":"A. Salomaa","year":"2011","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: Undecidability of the State Complexity of Composed Regular Operations. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 489\u2013498. Springer, Heidelberg (2011)"},{"issue":"2","key":"12_CR20","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"},{"key":"12_CR21","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":"12_CR22","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)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31623-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:40:34Z","timestamp":1620114034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}