{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:30Z","timestamp":1725731370096},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_5","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"30-41","source":"Crossref","is-referenced-by-count":2,"title":["Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\/2","key":"5_CR1","first-page":"71","volume":"15","author":"J. Brzozowski","year":"2010","unstructured":"Brzozowski, J.: Quotient complexity of regular languages. J. Autom. Lang. Comb.\u00a015(1\/2), 71\u201389 (2010)","journal-title":"J. Autom. Lang. Comb."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-31606-7_2","volume-title":"Implementation and Application of Automata","author":"J. Brzozowski","year":"2012","unstructured":"Brzozowski, J.: In search of most complex regular languages. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 5\u201324. Springer, Heidelberg (2012)"},{"key":"5_CR3","unstructured":"Brzozowski, J., Liu, D.: Universal witnesses for state complexity of basic operations combined with reversal (July 2012), http:\/\/arxiv.org\/abs\/1207.0535"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Liu, D.: Universal witnesses for state complexity of boolean operations and concatenation combined with star (July 2012), http:\/\/arxiv.org\/abs\/1207.1982","DOI":"10.1007\/978-3-642-39310-5_5"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2012.02.030","volume":"437","author":"B. Cui","year":"2012","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of combined operations with two basic operations. Theoret. Comput. Sci.\u00a0437, 82\u2013102 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S0129054112400047","volume":"23","author":"B. Cui","year":"2012","unstructured":"Cui, B., Gao, Y., Kari, L., Yu, S.: State complexity of two combined operations: catenation-star and catenation-reversal. Int. J. Found. Comput. Sc.\u00a023(1), 51\u201366 (2012)","journal-title":"Int. J. Found. Comput. Sc."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2011.12.028","volume":"429","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Kari, L., Yu, S.: State complexity of union and intersection of star on k regular languages. Theoret. Comput. Sci.\u00a0429, 98\u2013107 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"5_CR8","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. Fund. Inform.\u00a083(1-2), 75\u201389 (2008)","journal-title":"Fund. Inform."},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2012-663","volume":"116","author":"Y. Gao","year":"2012","unstructured":"Gao, Y., Yu, S.: State complexity of combined operations with union, intersection, star, and reversal. Fund. Inform.\u00a0116, 1\u201314 (2012)","journal-title":"Fund. Inform."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-427","volume":"109","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of star of union and star of intersection. Fund. Inform.\u00a0109, 1\u201318 (2011)","journal-title":"Fund. Inform."},{"key":"5_CR11","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":"5_CR12","first-page":"221","volume":"6","author":"S. Yu","year":"2001","unstructured":"Yu, S.: State complexity of regular languages. J. Autom. Lang. Comb.\u00a06, 221\u2013234 (2001)","journal-title":"J. Autom. Lang. Comb."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T11:04:27Z","timestamp":1595934267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}