{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086586},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358425"},{"type":"electronic","value":"9783642358432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35843-2_28","type":"book-chapter","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T21:24:54Z","timestamp":1357853094000},"page":"319-331","source":"Crossref","is-referenced-by-count":3,"title":["Incomplete Transition Complexity of Some Basic Operations"],"prefix":"10.1007","author":[{"given":"Eva","family":"Maia","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"35","key":"28_CR1","doi-asserted-by":"publisher","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","volume":"410","author":"H. Bordihn","year":"2009","unstructured":"Bordihn, H., Holzer, M., Kutrib, M.: Determination of finite automata accepting subregular languages. Theor. Comput. Sci.\u00a0410(35), 3209\u20133222 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13089-2_1","volume-title":"Language and Automata Theory and Applications","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Complexity in Convex Languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 1\u201315. Springer, Heidelberg (2010)"},{"key":"28_CR3","unstructured":"Cassandras, C.G., Lafortune, S.: Introduction to discrete event systems. Springer (2006)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-22256-6_12","volume-title":"Implementation and Application of Automata","author":"J. Daciuk","year":"2011","unstructured":"Daciuk, J., Weiss, D.: Smaller Representation of Finite\u00a0State\u00a0Automata. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol.\u00a06807, pp. 118\u2013129. Springer, Heidelberg (2011)"},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2007.07.034","volume":"387","author":"M. Domaratzki","year":"2007","unstructured":"Domaratzki, M., Salomaa, K.: Transition complexity of language operations. Theor. Comput. Sci.\u00a0387(2), 147\u2013154 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1-4","key":"28_CR6","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. Fundam. Inform.\u00a0110(1-4), 143\u2013158 (2011)","journal-title":"Fundam. Inform."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44977-9_14","volume-title":"Implementation and Application of Automata","author":"M. Holzer","year":"2003","unstructured":"Holzer, M., Kutrib, M.: State Complexity of Basic Operations on Nondeterministic Finite Automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 148\u2013157. Springer, Heidelberg (2003)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-00982-2_3","volume-title":"Language and Automata Theory and Applications","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Descriptional and Computational Complexity of Finite Automata. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 23\u201342. Springer, Heidelberg (2009)"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0129054109006747","volume":"20","author":"M. Holzer","year":"2009","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic finite automata - recent results on the descriptional and computational complexity. Int. J. Found. Comput. Sci.\u00a020(4), 563\u2013580 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"28_CR10","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S. Owens","year":"2009","unstructured":"Owens, S., Reppy, J.H., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program.\u00a019(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-73208-2_6","volume-title":"Developments in Language Theory","author":"K. Salomaa","year":"2007","unstructured":"Salomaa, K.: Descriptional Complexity of Nondeterministic Finite Automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 31\u201335. Springer, Heidelberg (2007)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. CUP (2008)","DOI":"10.1017\/CBO9780511808876"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"issue":"1-4","key":"28_CR15","first-page":"471","volume":"64","author":"S. Yu","year":"2005","unstructured":"Yu, S.: State complexity: Recent results and open problems. Fundam. Inform.\u00a064(1-4), 471\u2013480 (2005)","journal-title":"Fundam. Inform."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11812128_3","volume-title":"Implementation and Application of Automata","author":"S. Yu","year":"2006","unstructured":"Yu, S.: On the State Complexity of Combined Operations. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 11\u201322. Springer, Heidelberg (2006)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-22321-1_5","volume-title":"Developments in Language Theory","author":"S. Yu","year":"2011","unstructured":"Yu, S., Gao, Y.: State Complexity Research and Approximation. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 46\u201357. Springer, Heidelberg (2011)"},{"issue":"2","key":"28_CR18","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. Theor. Comput. Sci.\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2013: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35843-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T01:44:26Z","timestamp":1595209466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35843-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358425","9783642358432"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35843-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}