{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:21Z","timestamp":1725491421581},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_3","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"11-22","source":"Crossref","is-referenced-by-count":8,"title":["On the State Complexity of Combined Operations"],"prefix":"10.1007","author":[{"given":"Sheng","family":"Yu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(93)90160-U","volume":"119","author":"J.-C. Birget","year":"1993","unstructured":"Birget, J.-C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theoretical Computer Science\u00a0119, 267\u2013291 (1993)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","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":"3_CR3","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":"3_CR4","first-page":"53","volume-title":"Finite vs Infinite \u2013 Contributions to an Eternal Dilemma, Ch.5","author":"C. Campeanu","year":"2000","unstructured":"Campeanu, C., Salomaa, K., Yu, S.: State Complexity of Regular Languages: Finite Versus Infinite. In: Calude, C., Paun, G. (eds.) Finite vs Infinite \u2013 Contributions to an Eternal Dilemma, Ch.5, pp. 53\u201373. Springer, Heidelberg (2000)"},{"key":"3_CR5","first-page":"455","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity and proportional removals. Journal of Automata, Languages and Combinatorics\u00a07, 455\u2013468 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"3_CR6","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular Expressions: New Results and Open Problems. Journal of Automata, Languages and Combinatorics (to appear)"},{"key":"3_CR7","unstructured":"Gao, Y., Salomaa, K., Yu, S.: State complexity of catenation and reversal combined with star. In: Descriptional Complexity of Formal Systems (DCFS 2006) (to appear)"},{"key":"3_CR8","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":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45005-X_14","volume-title":"Developments in Language Theory","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Unary language operations and their nondeterministic state complexity. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 162\u2013172. Springer, Heidelberg (2003)"},{"issue":"4","key":"3_CR10","first-page":"453","volume":"6","author":"M. Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. Journal of Automata, Languages and Combinatorics\u00a06(4), 453\u2013466 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"3_CR11","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":"3_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0304-3975(00)00029-3","volume":"237","author":"K. Iwama","year":"2000","unstructured":"Iwama, K., Kambayashi, Y., Takaki, K.: Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theoretical Computer Science\u00a0237, 485\u2013494 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR13","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on regular languages. In: Proceedings of 5th Workshop on Descriptional Complexity of Formal Systems, pp. 114\u2013125 (2003)"},{"key":"3_CR14","unstructured":"Jir\u00e1skov\u00e1, G.: State complexity of some operations on binary regular languages. Theoretical Computer Science (to appear)"},{"key":"3_CR15","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":"3_CR16","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: State complexity of cyclic shift. In: Proceedings of DCFS 2005, Como, Italy, pp. 182\u2013193 (June 30 - July 2, 2005)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E. Leiss","year":"1981","unstructured":"Leiss, E.: Succinct representation of regular languages by boolean automata II. Theoretical Computer Science\u00a013, 323\u2013330 (1981)","journal-title":"Theoretical Computer Science"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48340-3_21","volume-title":"Mathematical Foundations of Computer Science 1999","author":"C. Nicaud","year":"1999","unstructured":"Nicaud, C.: Average State Complexity of Operations on Unary Automata. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S012905410200100X","volume":"13","author":"G. Pighizzini","year":"2002","unstructured":"Pighizzini, G., Shallit, J.: Unary language operations, state complexity and Jacobsthal\u2019s function. International Journal of Foundations of Computer Science\u00a013(1), 145\u2013159 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"3_CR20","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":"3_CR21","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata. Pergamon Press, Oxford (1969)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: State Complexity of Combined Operations. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2007.04.015"},{"key":"3_CR23","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"},{"issue":"3","key":"3_CR24","first-page":"177","volume":"2","author":"K. Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. Journal of Automata, Languages and Combinatorics\u00a02(3), 177\u2013186 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"3_CR25","doi-asserted-by":"crossref","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":"3_CR26","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":"3_CR27","unstructured":"Yu, S.: State Complexity: Recent Results and Open Problems. In: ICALP 2004 Formal Language Workshop, also appears in Fundamenta Informaticae 64(1-4), 471\u2013480 (2005) (invited talk)"},{"key":"3_CR28","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. Theoretical Computer Science\u00a0125, 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:58Z","timestamp":1619508418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11812128_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}