{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:18Z","timestamp":1725731358680},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_7","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"54-65","source":"Crossref","is-referenced-by-count":3,"title":["State Complexity of Basic Operations on Non-returning 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":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Berstel, J., Perrin, D.: Theory of code. Academic Press, Inc. (1985)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM\u00a011, 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. In: DCFS, pp. 17\u201328 (2009)","DOI":"10.4204\/EPTCS.3.2"},{"key":"7_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 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":"7_CR5","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. J. Autom. Lang. Comb.\u00a07, 303\u2013310 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"7_CR6","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)"},{"key":"7_CR7","first-page":"455","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity of proportional removals. J. Autom. Lang. Comb.\u00a07, 455\u2013468 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"7_CR8","first-page":"217","volume":"9","author":"M. Domaratzki","year":"2004","unstructured":"Domaratzki, M., Salomaa, K.: State complexity of shuffle on trajectories. J. Autom. Lang. Comb.\u00a09, 217\u2013232 (2004)","journal-title":"J. Autom. Lang. Comb."},{"key":"7_CR9","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. Internat. J. Found. Comput. Sci.\u00a019, 581\u2013595 (2008)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"7_CR10","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. Theoret. Comput. Sci.\u00a0410, 2537\u20132548 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","unstructured":"Han, Y.-S., Salomaa, K., Wood. D.: Operational state complexity of prefix-free regular languages. In: Automata, Formal Languages, and Related Topics, pp. 99\u2013115 (2009)"},{"key":"7_CR12","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. Internat. J. Found. Comput. Sci.\u00a014, 1087\u20131102 (2003)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"7_CR13","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., \u0160ebej, J.: Reversal of binary regular languages. Theoret. Comput. Sci.\u00a0449, 85\u201392 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR14","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. Theoret. Comput. Sci.\u00a0330, 287\u2013298 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.3233\/FI-2011-502","volume":"109","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Fund. Inform.\u00a0109, 161\u2013178 (2011)","journal-title":"Fund. Inform."},{"key":"7_CR16","doi-asserted-by":"crossref","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. Theoret. Comput. Sci.\u00a013, 323\u2013330 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR17","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 Math. Dokl.\u00a011, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"7_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)"},{"key":"7_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. Internat. J. Found. Comput. Sci.\u00a013, 145\u2013159 (2002)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"7_CR20","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. Theoret. Comput. Sci.\u00a0383, 140\u2013152 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR21","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. Theoret. Comput. Sci.\u00a0320, 315\u2013329 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR22","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":"7_CR23","volume-title":"Theory of computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of computation. John Wiley & Sons, Inc., New York (1987)"},{"key":"7_CR24","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. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR25","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb.\u00a06, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110 (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T11:03:45Z","timestamp":1595934225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}