{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:35Z","timestamp":1759637855151},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_22","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"217-228","source":"Crossref","is-referenced-by-count":5,"title":["State Complexity of Union and Intersection of Finite Languages"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11605157_10","volume-title":"Implementation and Application of Automata","author":"T. Claveirole","year":"2006","unstructured":"Claveirole, T., Lombardy, S., O\u2019Connor, S., Pouchet, L.-N., Sakarovitch, J.: Inside Vaucanson. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 116\u2013128. Springer, Heidelberg (2006)"},{"key":"22_CR3","first-page":"233","volume":"9","author":"K. Ellul","year":"2004","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics\u00a09, 233\u2013256 (2004)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"22_CR4","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of DCFS 2006, pp. 165\u2013176, Full version is submitted for publication (2006)"},{"key":"22_CR5","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":"2002","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 (2002)"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0129054103002199","volume":"14","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. International Journal of Foundations of Computer Science\u00a014(6), 1087\u20131102 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"22_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading, MA (1979)","edition":"2"},{"key":"22_CR8","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 (2005)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/978-3-540-30500-2_17","volume-title":"Implementation and Application of Automata","author":"J. Jir\u00e1sek","year":"2005","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov, G., Szabari, A.: State complexity of concatenation and complementation of regular languages. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"key":"22_CR10","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":"22_CR11","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":"22_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D.R. Raymond","year":"1994","unstructured":"Raymond, D.R., Wood, D.: Grail: A C++ library for automata and expressions. Journal of Symbolic Computation\u00a017, 341\u2013350 (1994)","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"22_CR13","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":"22_CR14","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","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:34Z","timestamp":1619517934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}