{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:18:58Z","timestamp":1740097138619,"version":"3.37.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192246"},{"type":"electronic","value":"9783319192253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19225-3_17","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T11:51:06Z","timestamp":1434369066000},"page":"197-208","source":"Crossref","is-referenced-by-count":0,"title":["Universal Disjunctive Concatenation and Star"],"prefix":"10.1007","author":[{"given":"Nelma","family":"Moreira","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"JC Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185\u2013190 (1992)","journal-title":"Inf. Process. Lett."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(96)00044-0","volume":"58","author":"JC Birget","year":"1996","unstructured":"Birget, J.C.: The state complexity of \n                      \n                        \n                      \n                      $$\\overline{\\Sigma ^\\star \\overline{L}}$$\n                     and its connection with temporal logic. Inf. Process. Lett. 58, 185\u2013188 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1142\/S0129054111008052","volume":"22","author":"JA Brzozowski","year":"2011","unstructured":"Brzozowski, J.A., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem. Int. J. Found. Comput. Sci. 22(2), 301\u2013321 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981). \n                      http:\/\/doi.acm.org\/10.1145\/322234.322243","journal-title":"J. ACM"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-662-46078-8_28","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science-Testing","author":"N Moreira","year":"2015","unstructured":"Moreira, N., Pighizzini, G., Reis, R.: Optimal state reductions of automata with partially specified behaviors. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015-Testing. LNCS, vol. 8939, pp. 339\u2013351. Springer, Heidelberg (2015). \n                      http:\/\/dx.doi.org\/10.1007\/978-3-662-46078-8_28"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02304905","volume":"8","author":"H Putnam","year":"1957","unstructured":"Putnam, H.: Three-valued logic. Philos. Stud. 8(5), 73\u201380 (1957)","journal-title":"Philos. Stud."},{"issue":"2","key":"17_CR7","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. 125(2), 315\u2013328 (1994)","journal-title":"Theor. Comput. Sci."}],"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-319-19225-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T01:39:12Z","timestamp":1559180352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19225-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192246","9783319192253"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19225-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}