{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:05:23Z","timestamp":1725660323323},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276538"},{"type":"electronic","value":"9783642276545"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27654-5_30","type":"book-chapter","created":{"date-parts":[[2012,2,15]],"date-time":"2012-02-15T08:46:33Z","timestamp":1329295593000},"page":"388-402","source":"Crossref","is-referenced-by-count":4,"title":["State Complexity of Kleene-Star Operations on Trees"],"prefix":"10.1007","author":[{"given":"Xiaoxue","family":"Piao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"5668","DOI":"10.1016\/j.tcs.2011.06.021","volume":"412","author":"C.S. Calude","year":"2011","unstructured":"Calude, C.S., Salomaa, K., Roblot, T.: Finite state complexity. Theoret. Comput. Sci.\u00a0412, 5668\u20135677 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Calude, C.S., Salomaa, K., Roblot, T.: State-size hierarchy for finite-state complexity. Internat. J. Foundations Comput. Sci. (accepted, 2011)","DOI":"10.1016\/j.tcs.2011.06.021"},{"key":"30_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), electronic book available at tata.gforge.inria.fr"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11537311_7","volume-title":"Fundamentals of Computation Theory","author":"J. Cristau","year":"2005","unstructured":"Cristau, J., L\u00f6ding, C., Thomas, W.: Deterministic Automata on Unranked Trees. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 68\u201379. Springer, Heidelberg (2005)"},{"key":"30_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. Theoret. Comput. Sci.\u00a0410, 2377\u20132392 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR6","first-page":"407","volume":"10","author":"K. Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: New results and open problems. J. Automata, Lang. and Combinatorics\u00a010, 407\u2013437 (2005)","journal-title":"J. Automata, Lang. and Combinatorics"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/FI-2011-533","volume":"110","author":"Y. Gao","year":"2011","unstructured":"Gao, Y., Salomaa, K., Yu, S.: Transition complexity of incomplete DFAs. Fundamenta Informaticae\u00a0110, 143\u2013158 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-642-22600-7_13","volume-title":"DCFS 2011","author":"Y. Gao","year":"2011","unstructured":"Gao, Y., Yu, S.: State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol.\u00a06808, pp. 158\u2013171. Springer, Heidelberg (2011)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: [20], vol.\u00a0III, pp. 1\u201368","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-02737-6_22","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M.: Tight Bounds on the Descriptional Complexity of Regular Expressions. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 276\u2013287. Springer, Heidelberg (2009)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M. Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata \u2014 A survey. Inf. Comput.\u00a0209, 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"30_CR12","first-page":"453","volume":"6","author":"M. Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. J. Automata, Languages and Combinatorics\u00a06, 453\u2013466 (2001)","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-85780-8_35","volume-title":"Developments in Language Theory","author":"G. Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the State Complexity of Operations on Two-Way Finite Automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 443\u2013454. Springer, Heidelberg (2008)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-22012-8_15","volume-title":"Automata, Languages and Programming","author":"C.A. Kapoutsis","year":"2011","unstructured":"Kapoutsis, C.A.: Nondeterminism Is Essential in Small 2FAs with Few Reversals. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 198\u2013209. Springer, Heidelberg (2011)"},{"key":"30_CR15","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. J. Comput. System Sci.\u00a073, 550\u2013583 (2007)","journal-title":"J. Comput. System Sci."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Piao, X., Salomaa, K.: Operational state complexity of deterministic unranked tree automata. In: Proc. of DCFS 2010, pp. 181\u2013192 (2010)","DOI":"10.4204\/EPTCS.31.17"},{"key":"30_CR17","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. Fund. Informaticae\u00a0109, 405\u2013424 (2011)","journal-title":"Fund. Informaticae"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Piao, X., Salomaa, K.: State complexity of star and quotient operation for unranked tree automata, School of Computing, Queen\u2019s University Technical Report No. 2011-577 (19 pp.) (2011)","DOI":"10.1007\/978-3-642-22600-7_21"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-642-22600-7_21","volume-title":"DCFS 2011","author":"X. Piao","year":"2011","unstructured":"Piao, X., Salomaa, K.: State Trade-Offs in Unranked Tree Automata. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol.\u00a06808, pp. 261\u2013274. Springer, Heidelberg (2011)"},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"30_CR20","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a0I\u2013III. Springer, Heidelberg (1997)"},{"key":"30_CR21","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":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-21254-3_39","volume-title":"Language and Automata Theory and Applications","author":"A. Salomaa","year":"2011","unstructured":"Salomaa, A., Salomaa, K., Yu, S.: Undecidability of the State Complexity of Composed Regular Operations. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 489\u2013498. Springer, Heidelberg (2011)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.jcss.2006.10.003","volume":"73","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T.: Automata for XML, \u2014 a survey. J. Comput. System Sci.\u00a073, 289\u2013315 (2007)","journal-title":"J. Comput. System Sci."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511808876"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: [20], vol.\u00a0I, pp. 41\u2013110","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"30_CR26","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 complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computation, Physics and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27654-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,29]],"date-time":"2021-12-29T05:10:41Z","timestamp":1640754641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27654-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276538","9783642276545"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27654-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}