{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:30Z","timestamp":1725731370762},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_9","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"78-89","source":"Crossref","is-referenced-by-count":5,"title":["State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages"],"prefix":"10.1007","author":[{"given":"Hae-Sung","family":"Eom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Culik II, 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":"9_CR2","first-page":"303","volume":"7","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, 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":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-25929-6_9","volume-title":"Mathematical and Engineering Methods in Computer Science","author":"R. Cmorik","year":"2012","unstructured":"Cmorik, R., Jir\u00e1skov\u00e1, G.: Basic operations on binary suffix-free languages. In: Kot\u00e1sek, Z., Bouda, J., \u010cern\u00e1, I., Sekanina, L., Vojnar, T., Anto\u0161, D. (eds.) MEMICS 2011. LNCS, vol.\u00a07119, pp. 94\u2013102. Springer, Heidelberg (2012)"},{"issue":"4","key":"9_CR4","first-page":"455","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity of proportional removals. Journal of Automata, Languages and Combinatorics\u00a07(4), 455\u2013468 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"24-25","key":"9_CR5","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":"2-3","key":"9_CR6","first-page":"217","volume":"9","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. Journal of Automata, Languages and Combinatorics\u00a09(2-3), 217\u2013232 (2004)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"35","key":"9_CR7","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"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-31623-4_12","volume-title":"Descriptional Complexity of Formal Systems","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Kari, L.: State complexity of star and square of union of k regular languages. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 155\u2013168. Springer, Heidelberg (2012)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2012.03.046","volume":"454","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Kari, L., Yu, S.: State complexity of union and intersection of square and reversal on k regular languages. Theoretical Computer Science\u00a0454, 164\u2013171 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"9_CR10","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"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1142\/S0129054108005838","volume":"19","author":"Y.-S. Han","year":"2008","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of union and intersection of finite languages. International Journal of Foundations of Computer Science\u00a019(3), 581\u2013595 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"27-29","key":"9_CR12","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","volume":"410","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., 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":"9_CR13","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics - Dedicated to Ferenc G\u00e9cseg on the Occasion of his 70th Birthday","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics - Dedicated to Ferenc G\u00e9cseg on the Occasion of his 70th Birthday, pp. 99\u2013115. Institute of Informatics, University of Szeged, Hungary (2009)"},{"key":"9_CR14","first-page":"170","volume-title":"Proceedings of DCFS 2005","author":"M. Hricko","year":"2005","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. In: Proceedings of DCFS 2005, pp. 170\u2013181. Universit\u00e0 degli Studi di Milano, Milan (2005)"},{"issue":"3","key":"9_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. International Journal of Foundations of Computer Science\u00a016(3), 511\u2013529 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"7","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. International Journal of Foundations of Computer Science\u00a022(7), 1639\u20131653 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR17","unstructured":"Jir\u00e1skov\u00e1, G., Olej\u00e1r, P.: State complexity of intersection and union of suffix-free languages and descriptional complexity. In: Proceedings of NCMA 2009, pp. 151\u2013166. Austrian Computer Society (2009)"},{"key":"9_CR18","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., Sebej, J.: Reversal of binary regular languages. Theoretical Computer Science\u00a0449, 85\u201392 (2012)","journal-title":"Theoretical Computer Science"},{"key":"9_CR19","first-page":"1373","volume":"11","author":"A. Maslov","year":"1970","unstructured":"Maslov, A.: Estimates of the number of states of finite automata. Soviet Mathematics Doklady\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"9_CR20","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":"9_CR21","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"},{"issue":"6","key":"9_CR22","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(6), 231\u2013234 (2006)","journal-title":"Information Processing Letters"},{"issue":"2-3","key":"9_CR23","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(2-3), 140\u2013152 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"9_CR24","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. Theoretical Computer Science\u00a0320(2-3), 315\u2013329 (2004)","journal-title":"Theoretical Computer Science"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1142\/S0129054107004917","volume":"18","author":"K. Salomaa","year":"2007","unstructured":"Salomaa, K., Yu, S.: On the state complexity of combined operations and their estimation. International Journal of Foundations of Computer Science\u00a018, 683\u2013698 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J. Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, New York (2008)"},{"key":"9_CR27","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York (1987)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"2","key":"9_CR29","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"},{"issue":"2","key":"9_CR30","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(2), 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"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-39310-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T03:52:11Z","timestamp":1557805931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}