{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:03Z","timestamp":1725488943341},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_45","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"501-512","source":"Crossref","is-referenced-by-count":2,"title":["State Complexity of Basic Operations on Suffix-Free Regular Languages"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc., London (1985)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/IRETELC.1962.5407917","volume":"11","author":"J. Brzozowski","year":"1962","unstructured":"Brzozowski, J.: A survey of regular expressions and their applications. IEEE Transactions on Electronic Computers\u00a011, 324\u2013335 (1962)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"45_CR3","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":"45_CR4","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"},{"issue":"4","key":"45_CR5","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":"2-3","key":"45_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"},{"key":"45_CR7","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of basic operations on suffix-free regular languages. Technical Report Technical Report 2007-534, Queen\u2019s University (2007), \n                    \n                      http:\/\/www.cs.queensu.ca\/TechReports\/Reports\/2007-534.pdf"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Han, Y.-S., Salomaa, K.: State complexity of union and intersection of finite languages. In: Proceedings of DLT 2007. LNCS, vol.\u00a04588, pp. 217\u2013228 (2007)","DOI":"10.1007\/978-3-540-73208-2_22"},{"key":"45_CR9","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of DCFS 2006, pp. 165\u2013176 (2006) (Full version is submitted for publication)"},{"issue":"3","key":"45_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054105003121","volume":"16","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science\u00a016(3), 499\u2013510 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"45_CR11","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":"6","key":"45_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. International Journal of Foundations of Computer Science\u00a014(6), 1087\u20131102 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"45_CR13","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":"45_CR14","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":"45_CR15","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\u00e1, 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":"45_CR16","series-title":"Handbook of Formal Languages","first-page":"511","volume-title":"Word, Language, Grammar","author":"H. J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol.\u00a01, pp. 511\u2013607. Springer, Heidelberg (1997)"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(81)80005-9","volume":"13","author":"E.L. Leiss","year":"1981","unstructured":"Leiss, E.L.: Succint representation of regular languages by boolean automata. Theoretical Computer Science\u00a013, 323\u2013330 (1981)","journal-title":"Theoretical Computer Science"},{"key":"45_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":"45_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"},{"issue":"2-3","key":"45_CR20","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":"45_CR21","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York, NY (1987)"},{"key":"45_CR22","series-title":"Handbook of Formal Languages","first-page":"41","volume-title":"Word, Language, Grammar","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"issue":"2","key":"45_CR23","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":"45_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. Theoretical Computer Science\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:12Z","timestamp":1619519352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}