{"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":1725731358522},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_8","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"66-77","source":"Crossref","is-referenced-by-count":1,"title":["State Complexity of Subtree-Free Regular Tree 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":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Inc. (1985)"},{"key":"8_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 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":"8_CR3","unstructured":"Comon, H., Dauchet, M., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), Electronic book available at www.tata.gforge.inria.fr"},{"issue":"24-25","key":"8_CR4","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":"35","key":"8_CR5","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"},{"issue":"1-2","key":"8_CR6","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"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Handbook of Formal Languages. Tree languages. In: vol.\u00a03, pp. 1\u201368 (1997)","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"3","key":"8_CR8","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":"8_CR9","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":"8_CR10","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: State complexity of prefix-free regular languages. In: Proceedings of the 8th International Conference on Descriptional Complexity of Formal Systems, pp. 165\u2013176 (2006)"},{"key":"8_CR11","first-page":"170","volume":"2005","author":"M. Hricko","year":"2005","unstructured":"Hricko, M., Jir\u00e1skov\u00e1, G., Szabari, A.: Union and intersection of regular languages and descriptional complexity. Proceedings of the 7th International Conference on Descriptional Complexity of Formal Systems\u00a02005, 170\u2013181 (2005)","journal-title":"Proceedings of the 7th International Conference on Descriptional Complexity of Formal Systems"},{"issue":"3","key":"8_CR12","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":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.jcss.2006.10.021","volume":"73","author":"W. Martens","year":"2007","unstructured":"Martens, W., Niehren, J.: On the minimization of XML schemas and tree automata for unranked trees. Journal of Computer System Sciences\u00a073(4), 550\u2013583 (2007)","journal-title":"Journal of Computer System Sciences"},{"key":"8_CR14","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"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/601858.601869","volume":"31","author":"F. Neven","year":"2002","unstructured":"Neven, F.: Automata theory for XML researchers. ACM SIGMOD Record\u00a031(3), 39\u201346 (2002)","journal-title":"ACM SIGMOD Record"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Piao, X., Salomaa, K.: State trade-offs in unranked tree automata. In: Proceedings of the 13th International Conference on Descriptional Complexity of Formal Systems, pp. 261\u2013274 (2011)","DOI":"10.1007\/978-3-642-22600-7_21"},{"issue":"4","key":"8_CR18","doi-asserted-by":"crossref","first-page":"405","DOI":"10.3233\/FI-2011-519","volume":"109","author":"X. Piao","year":"2011","unstructured":"Piao, X., Salomaa, K.: Transformations between different models of unranked bottom-up tree automata. Fundamenta Informaticae\u00a0109(4), 405\u2013424 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-27654-5_30","volume-title":"Computation, Physics and Beyond","author":"X. Piao","year":"2012","unstructured":"Piao, X., Salomaa, K.: State complexity of kleene-star operations on trees. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) Computation, Physics and Beyond. LNCS, vol.\u00a07160, pp. 388\u2013402. Springer, Heidelberg (2012)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2011.12.048","volume":"429","author":"X. Piao","year":"2012","unstructured":"Piao, X., Salomaa, K.: State complexity of the concatenation of regular tree languages. Theoretical Computer Science\u00a0429, 273\u2013281 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_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":"2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"issue":"6","key":"8_CR23","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 2 and L k . Information Processing Letters\u00a098(6), 231\u2013234 (2006)","journal-title":"Information Processing Letters"},{"issue":"2-3","key":"8_CR24","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"},{"key":"8_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"},{"issue":"2","key":"8_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"},{"issue":"2","key":"8_CR27","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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T11:04:01Z","timestamp":1595934241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}